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

Theorem ufilen 21544
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 7847 . . . . . 6 Rel ≼
21brrelex2i 5083 . . . . 5 (ω ≼ 𝑋𝑋 ∈ V)
3 numth3 9175 . . . . 5 (𝑋 ∈ V → 𝑋 ∈ dom card)
42, 3syl 17 . . . 4 (ω ≼ 𝑋𝑋 ∈ dom card)
5 csdfil 21508 . . . 4 ((𝑋 ∈ dom card ∧ ω ≼ 𝑋) → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
64, 5mpancom 700 . . 3 (ω ≼ 𝑋 → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
7 filssufil 21526 . . 3 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋) → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
86, 7syl 17 . 2 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
9 elfvex 6131 . . . . . . 7 (𝑓 ∈ (UFil‘𝑋) → 𝑋 ∈ V)
109ad2antlr 759 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑋 ∈ V)
11 ufilfil 21518 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (Fil‘𝑋))
12 filelss 21466 . . . . . . . 8 ((𝑓 ∈ (Fil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1311, 12sylan 487 . . . . . . 7 ((𝑓 ∈ (UFil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1413adantll 746 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
15 ssdomg 7887 . . . . . 6 (𝑋 ∈ V → (𝑥𝑋𝑥𝑋))
1610, 14, 15sylc 63 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
17 filfbas 21462 . . . . . . . . 9 (𝑓 ∈ (Fil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1811, 17syl 17 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1918adantl 481 . . . . . . 7 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → 𝑓 ∈ (fBas‘𝑋))
20 fbncp 21453 . . . . . . 7 ((𝑓 ∈ (fBas‘𝑋) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
2119, 20sylan 487 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
22 difss 3699 . . . . . . . . . . . . . 14 (𝑋𝑥) ⊆ 𝑋
23 elpw2g 4754 . . . . . . . . . . . . . 14 (𝑋 ∈ V → ((𝑋𝑥) ∈ 𝒫 𝑋 ↔ (𝑋𝑥) ⊆ 𝑋))
2422, 23mpbiri 247 . . . . . . . . . . . . 13 (𝑋 ∈ V → (𝑋𝑥) ∈ 𝒫 𝑋)
25243ad2ant1 1075 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ 𝒫 𝑋)
26 simp2 1055 . . . . . . . . . . . . . 14 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
27 dfss4 3820 . . . . . . . . . . . . . 14 (𝑥𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) = 𝑥)
2826, 27sylib 207 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) = 𝑥)
29 simp3 1056 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
3028, 29eqbrtrd 4605 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋)
31 difeq2 3684 . . . . . . . . . . . . . 14 (𝑦 = (𝑋𝑥) → (𝑋𝑦) = (𝑋 ∖ (𝑋𝑥)))
3231breq1d 4593 . . . . . . . . . . . . 13 (𝑦 = (𝑋𝑥) → ((𝑋𝑦) ≺ 𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋))
3332elrab 3331 . . . . . . . . . . . 12 ((𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ↔ ((𝑋𝑥) ∈ 𝒫 𝑋 ∧ (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋))
3425, 30, 33sylanbrc 695 . . . . . . . . . . 11 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋})
35 ssel 3562 . . . . . . . . . . 11 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ((𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} → (𝑋𝑥) ∈ 𝑓))
3634, 35syl5com 31 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
37363expa 1257 . . . . . . . . 9 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ 𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
3837impancom 455 . . . . . . . 8 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (𝑥𝑋 → (𝑋𝑥) ∈ 𝑓))
3938con3d 147 . . . . . . 7 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (¬ (𝑋𝑥) ∈ 𝑓 → ¬ 𝑥𝑋))
4039impancom 455 . . . . . 6 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ ¬ (𝑋𝑥) ∈ 𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
4110, 14, 21, 40syl21anc 1317 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
42 bren2 7872 . . . . . 6 (𝑥𝑋 ↔ (𝑥𝑋 ∧ ¬ 𝑥𝑋))
4342simplbi2 653 . . . . 5 (𝑥𝑋 → (¬ 𝑥𝑋𝑥𝑋))
4416, 41, 43sylsyld 59 . . . 4 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓𝑥𝑋))
4544ralrimdva 2952 . . 3 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∀𝑥𝑓 𝑥𝑋))
4645reximdva 3000 . 2 (ω ≼ 𝑋 → (∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋))
478, 46mpd 15 1 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1031   = wceq 1475  wcel 1977  wral 2896  wrex 2897  {crab 2900  Vcvv 3173  cdif 3537  wss 3540  𝒫 cpw 4108   class class class wbr 4583  dom cdm 5038  cfv 5804  ωcom 6957  cen 7838  cdom 7839  csdm 7840  cardccrd 8644  fBascfbas 19555  Filcfil 21459  UFilcufil 21513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-ac2 9168
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-rpss 6835  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-fi 8200  df-oi 8298  df-card 8648  df-ac 8822  df-cda 8873  df-fbas 19564  df-fg 19565  df-fil 21460  df-ufil 21515
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator