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

Theorem ufilen 22827
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 8632 . . . . . 6 Rel ≼
21brrelex2i 5606 . . . . 5 (ω ≼ 𝑋𝑋 ∈ V)
3 numth3 10084 . . . . 5 (𝑋 ∈ V → 𝑋 ∈ dom card)
42, 3syl 17 . . . 4 (ω ≼ 𝑋𝑋 ∈ dom card)
5 csdfil 22791 . . . 4 ((𝑋 ∈ dom card ∧ ω ≼ 𝑋) → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
64, 5mpancom 688 . . 3 (ω ≼ 𝑋 → {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋))
7 filssufil 22809 . . 3 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ∈ (Fil‘𝑋) → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
86, 7syl 17 . 2 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓)
9 elfvex 6750 . . . . . . 7 (𝑓 ∈ (UFil‘𝑋) → 𝑋 ∈ V)
109ad2antlr 727 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑋 ∈ V)
11 ufilfil 22801 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (Fil‘𝑋))
12 filelss 22749 . . . . . . . 8 ((𝑓 ∈ (Fil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1311, 12sylan 583 . . . . . . 7 ((𝑓 ∈ (UFil‘𝑋) ∧ 𝑥𝑓) → 𝑥𝑋)
1413adantll 714 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
15 ssdomg 8674 . . . . . 6 (𝑋 ∈ V → (𝑥𝑋𝑥𝑋))
1610, 14, 15sylc 65 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → 𝑥𝑋)
17 filfbas 22745 . . . . . . . . 9 (𝑓 ∈ (Fil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1811, 17syl 17 . . . . . . . 8 (𝑓 ∈ (UFil‘𝑋) → 𝑓 ∈ (fBas‘𝑋))
1918adantl 485 . . . . . . 7 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → 𝑓 ∈ (fBas‘𝑋))
20 fbncp 22736 . . . . . . 7 ((𝑓 ∈ (fBas‘𝑋) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
2119, 20sylan 583 . . . . . 6 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ¬ (𝑋𝑥) ∈ 𝑓)
22 difeq2 4031 . . . . . . . . . . . . 13 (𝑦 = (𝑋𝑥) → (𝑋𝑦) = (𝑋 ∖ (𝑋𝑥)))
2322breq1d 5063 . . . . . . . . . . . 12 (𝑦 = (𝑋𝑥) → ((𝑋𝑦) ≺ 𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋))
24 difss 4046 . . . . . . . . . . . . . 14 (𝑋𝑥) ⊆ 𝑋
25 elpw2g 5237 . . . . . . . . . . . . . 14 (𝑋 ∈ V → ((𝑋𝑥) ∈ 𝒫 𝑋 ↔ (𝑋𝑥) ⊆ 𝑋))
2624, 25mpbiri 261 . . . . . . . . . . . . 13 (𝑋 ∈ V → (𝑋𝑥) ∈ 𝒫 𝑋)
27263ad2ant1 1135 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ 𝒫 𝑋)
28 simp2 1139 . . . . . . . . . . . . . 14 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
29 dfss4 4173 . . . . . . . . . . . . . 14 (𝑥𝑋 ↔ (𝑋 ∖ (𝑋𝑥)) = 𝑥)
3028, 29sylib 221 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) = 𝑥)
31 simp3 1140 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → 𝑥𝑋)
3230, 31eqbrtrd 5075 . . . . . . . . . . . 12 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋 ∖ (𝑋𝑥)) ≺ 𝑋)
3323, 27, 32elrabd 3604 . . . . . . . . . . 11 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → (𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋})
34 ssel 3893 . . . . . . . . . . 11 ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ((𝑋𝑥) ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} → (𝑋𝑥) ∈ 𝑓))
3533, 34syl5com 31 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝑥𝑋𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
36353expa 1120 . . . . . . . . 9 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ 𝑥𝑋) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → (𝑋𝑥) ∈ 𝑓))
3736impancom 455 . . . . . . . 8 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (𝑥𝑋 → (𝑋𝑥) ∈ 𝑓))
3837con3d 155 . . . . . . 7 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ {𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓) → (¬ (𝑋𝑥) ∈ 𝑓 → ¬ 𝑥𝑋))
3938impancom 455 . . . . . 6 (((𝑋 ∈ V ∧ 𝑥𝑋) ∧ ¬ (𝑋𝑥) ∈ 𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
4010, 14, 21, 39syl21anc 838 . . . . 5 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ¬ 𝑥𝑋))
41 bren2 8659 . . . . . 6 (𝑥𝑋 ↔ (𝑥𝑋 ∧ ¬ 𝑥𝑋))
4241simplbi2 504 . . . . 5 (𝑥𝑋 → (¬ 𝑥𝑋𝑥𝑋))
4316, 40, 42sylsyld 61 . . . 4 (((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) ∧ 𝑥𝑓) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓𝑥𝑋))
4443ralrimdva 3110 . . 3 ((ω ≼ 𝑋𝑓 ∈ (UFil‘𝑋)) → ({𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∀𝑥𝑓 𝑥𝑋))
4544reximdva 3193 . 2 (ω ≼ 𝑋 → (∃𝑓 ∈ (UFil‘𝑋){𝑦 ∈ 𝒫 𝑋 ∣ (𝑋𝑦) ≺ 𝑋} ⊆ 𝑓 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋))
468, 45mpd 15 1 (ω ≼ 𝑋 → ∃𝑓 ∈ (UFil‘𝑋)∀𝑥𝑓 𝑥𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  wral 3061  wrex 3062  {crab 3065  Vcvv 3408  cdif 3863  wss 3866  𝒫 cpw 4513   class class class wbr 5053  dom cdm 5551  cfv 6380  ωcom 7644  cen 8623  cdom 8624  csdm 8625  cardccrd 9551  fBascfbas 20351  Filcfil 22742  UFilcufil 22796
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-rep 5179  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523  ax-inf2 9256  ax-ac2 10077
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3410  df-sbc 3695  df-csb 3812  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-pss 3885  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-tp 4546  df-op 4548  df-uni 4820  df-int 4860  df-iun 4906  df-br 5054  df-opab 5116  df-mpt 5136  df-tr 5162  df-id 5455  df-eprel 5460  df-po 5468  df-so 5469  df-fr 5509  df-se 5510  df-we 5511  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-pred 6160  df-ord 6216  df-on 6217  df-lim 6218  df-suc 6219  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-f1 6385  df-fo 6386  df-f1o 6387  df-fv 6388  df-isom 6389  df-riota 7170  df-ov 7216  df-oprab 7217  df-mpo 7218  df-rpss 7511  df-om 7645  df-1st 7761  df-2nd 7762  df-wrecs 8047  df-recs 8108  df-rdg 8146  df-1o 8202  df-2o 8203  df-oadd 8206  df-er 8391  df-en 8627  df-dom 8628  df-sdom 8629  df-fin 8630  df-fi 9027  df-oi 9126  df-dju 9517  df-card 9555  df-ac 9730  df-fbas 20360  df-fg 20361  df-fil 22743  df-ufil 22798
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator