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

Theorem ufilen 22541
Description: Any infinite set has an ultrafilter on it whose elements are of the same cardinality as the set. Any such ultrafilter is necessarily free. (Contributed by Jeff Hankins, 7-Dec-2009.) (Revised by Stefan O'Rear, 3-Aug-2015.)
Assertion
Ref Expression
ufilen (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋)
Distinct variable group:   𝑥,𝑓,𝑋

Proof of Theorem ufilen
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 reldom 8518 . . . . . 6 Rel ≼
21brrelex2i 5612 . . . . 5 (ω ≼ 𝑋𝑋 ∈ V)
3 numth3 9895 . . . . 5 (𝑋 ∈ V → 𝑋 ∈ dom card)
42, 3syl 17 . . . 4 (ω ≼ 𝑋𝑋 ∈ dom card)
5 csdfil 22505 . . . 4 ((𝑋 ∈ dom card ∧ ω ≼ 𝑋) → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
64, 5mpancom 686 . . 3 (ω ≼ 𝑋 → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
7 filssufil 22523 . . 3 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋) → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
86, 7syl 17 . 2 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
9 elfvex 6706 . . . . . . 7 (𝑓 ∈ (UFil‘𝑋) → 𝑋 ∈ V)
109ad2antlr 725 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑋 ∈ V)
11 ufilfil 22515 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (Fil‘𝑋))
12 filelss 22463 . . . . . . . 8 ((𝑓 ∈ (Fil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1311, 12sylan 582 . . . . . . 7 ((𝑓 ∈ (UFil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1413adantll 712 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
15 ssdomg 8558 . . . . . 6 (𝑋 ∈ V → (𝑥𝑋𝑥𝑋))
1610, 14, 15sylc 65 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
17 filfbas 22459 . . . . . . . . 9 (𝑓 ∈ (Fil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1811, 17syl 17 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1918adantl 484 . . . . . . 7 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → 𝑓 ∈ (fBas‘𝑋))
20 fbncp 22450 . . . . . . 7 ((𝑓 ∈ (fBas‘𝑋) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
2119, 20sylan 582 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
22 difeq2 4096 . . . . . . . . . . . . 13 (𝑦 = (𝑋𝑥) → (𝑋𝑦) = (𝑋 ∖ (𝑋𝑥)))
2322breq1d 5079 . . . . . . . . . . . 12 (𝑦 = (𝑋𝑥) → ((𝑋𝑦) ≺ 𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋))
24 difss 4111 . . . . . . . . . . . . . 14 (𝑋𝑥) ⊆ 𝑋
25 elpw2g 5250 . . . . . . . . . . . . . 14 (𝑋 ∈ V → ((𝑋𝑥) ∈ 𝒫 𝑋 ↔ (𝑋𝑥) ⊆ 𝑋))
2624, 25mpbiri 260 . . . . . . . . . . . . 13 (𝑋 ∈ V → (𝑋𝑥) ∈ 𝒫 𝑋)
27263ad2ant1 1129 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ 𝒫 𝑋)
28 simp2 1133 . . . . . . . . . . . . . 14 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
29 dfss4 4238 . . . . . . . . . . . . . 14 (𝑥𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) = 𝑥)
3028, 29sylib 220 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) = 𝑥)
31 simp3 1134 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
3230, 31eqbrtrd 5091 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋)
3323, 27, 32elrabd 3685 . . . . . . . . . . 11 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋})
34 ssel 3964 . . . . . . . . . . 11 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ((𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} → (𝑋𝑥) ∈ 𝑓))
3533, 34syl5com 31 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
36353expa 1114 . . . . . . . . 9 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ 𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
3736impancom 454 . . . . . . . 8 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (𝑥𝑋 → (𝑋𝑥) ∈ 𝑓))
3837con3d 155 . . . . . . 7 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (¬ (𝑋𝑥) ∈ 𝑓 → ¬ 𝑥𝑋))
3938impancom 454 . . . . . 6 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ ¬ (𝑋𝑥) ∈ 𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
4010, 14, 21, 39syl21anc 835 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
41 bren2 8543 . . . . . 6 (𝑥𝑋 ↔ (𝑥𝑋 ∧ ¬ 𝑥𝑋))
4241simplbi2 503 . . . . 5 (𝑥𝑋 → (¬ 𝑥𝑋𝑥𝑋))
4316, 40, 42sylsyld 61 . . . 4 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓𝑥𝑋))
4443ralrimdva 3192 . . 3 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∀𝑥𝑓 𝑥𝑋))
4544reximdva 3277 . 2 (ω ≼ 𝑋 → (∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋))
468, 45mpd 15 1 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  w3a 1083   = wceq 1536  wcel 2113  wral 3141  wrex 3142  {crab 3145  Vcvv 3497  cdif 3936  wss 3939  𝒫 cpw 4542   class class class wbr 5069  dom cdm 5558  cfv 6358  ωcom 7583  cen 8509  cdom 8510  csdm 8511  cardccrd 9367  fBascfbas 20536  Filcfil 22456  UFilcufil 22510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-inf2 9107  ax-ac2 9888
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-se 5518  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-isom 6367  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-rpss 7452  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-1o 8105  df-2o 8106  df-oadd 8109  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-fin 8516  df-fi 8878  df-oi 8977  df-dju 9333  df-card 9371  df-ac 9545  df-fbas 20545  df-fg 20546  df-fil 22457  df-ufil 22512
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator