MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ufli Structured version   Visualization version   GIF version

Theorem ufli 23975
Description: Property of a set that satisfies the ultrafilter lemma. (Contributed by Mario Carneiro, 26-Aug-2015.)
Assertion
Ref Expression
ufli ((𝑋 ∈ UFL ∧ 𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
Distinct variable groups:   𝑓,𝐹   𝑓,𝑋

Proof of Theorem ufli
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 isufl 23974 . . 3 (𝑋 ∈ UFL → (𝑋 ∈ UFL ↔ ∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔𝑓))
21ibi 269 . 2 (𝑋 ∈ UFL → ∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔𝑓)
3 sseq1 3962 . . . 4 (𝑔 = 𝐹 → (𝑔𝑓𝐹𝑓))
43rexbidv 3187 . . 3 (𝑔 = 𝐹 → (∃𝑓 ∈ (UFil‘𝑋)𝑔𝑓 ↔ ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓))
54rspccva 3581 . 2 ((∀𝑔 ∈ (Fil‘𝑋)∃𝑓 ∈ (UFil‘𝑋)𝑔𝑓𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
62, 5sylan 589 1 ((𝑋 ∈ UFL ∧ 𝐹 ∈ (Fil‘𝑋)) → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1561  wcel 2143  wral 3077  wrex 3087  wss 3905  cfv 6522  Filcfil 23906  UFilcufil 23960  UFLcufl 23961
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-iota 6478  df-fv 6530  df-ufl 23963
This theorem is referenced by:  ssufl  23979  ufldom  24023  ufilcmp  24093
  Copyright terms: Public domain W3C validator