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

Theorem filssufilg 22511
Description: A filter is contained in some ultrafilter. This version of filssufil 22512 contains the choice as a hypothesis (in the assumption that 𝒫 𝒫 𝑋 is well-orderable). (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
filssufilg ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
Distinct variable groups:   𝑓,𝐹   𝑓,𝑋

Proof of Theorem filssufilg
Dummy variables 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 487 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → 𝒫 𝒫 𝑋 ∈ dom card)
2 rabss 4046 . . . . 5 ({𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ⊆ 𝒫 𝒫 𝑋 ↔ ∀𝑔 ∈ (Fil‘𝑋)(𝐹𝑔𝑔 ∈ 𝒫 𝒫 𝑋))
3 filsspw 22451 . . . . . . 7 (𝑔 ∈ (Fil‘𝑋) → 𝑔 ⊆ 𝒫 𝑋)
4 velpw 4545 . . . . . . 7 (𝑔 ∈ 𝒫 𝒫 𝑋𝑔 ⊆ 𝒫 𝑋)
53, 4sylibr 236 . . . . . 6 (𝑔 ∈ (Fil‘𝑋) → 𝑔 ∈ 𝒫 𝒫 𝑋)
65a1d 25 . . . . 5 (𝑔 ∈ (Fil‘𝑋) → (𝐹𝑔𝑔 ∈ 𝒫 𝒫 𝑋))
72, 6mprgbir 3151 . . . 4 {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ⊆ 𝒫 𝒫 𝑋
8 ssnum 9457 . . . 4 ((𝒫 𝒫 𝑋 ∈ dom card ∧ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ⊆ 𝒫 𝒫 𝑋) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∈ dom card)
91, 7, 8sylancl 588 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∈ dom card)
10 ssid 3987 . . . . . . 7 𝐹𝐹
1110jctr 527 . . . . . 6 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐹))
12 sseq2 3991 . . . . . . 7 (𝑔 = 𝐹 → (𝐹𝑔𝐹𝐹))
1312elrab 3678 . . . . . 6 (𝐹 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ↔ (𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐹))
1411, 13sylibr 236 . . . . 5 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔})
1514ne0d 4299 . . . 4 (𝐹 ∈ (Fil‘𝑋) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ≠ ∅)
1615adantr 483 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ≠ ∅)
17 sseq2 3991 . . . . . . 7 (𝑔 = 𝑥 → (𝐹𝑔𝐹 𝑥))
18 simpr1 1189 . . . . . . . . . 10 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔})
19 ssrab 4047 . . . . . . . . . 10 (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ↔ (𝑥 ⊆ (Fil‘𝑋) ∧ ∀𝑔𝑥 𝐹𝑔))
2018, 19sylib 220 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → (𝑥 ⊆ (Fil‘𝑋) ∧ ∀𝑔𝑥 𝐹𝑔))
2120simpld 497 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥 ⊆ (Fil‘𝑋))
22 simpr2 1190 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥 ≠ ∅)
23 simpr3 1191 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → [] Or 𝑥)
24 sorpssun 7448 . . . . . . . . . 10 (( [] Or 𝑥 ∧ (𝑔𝑥𝑥)) → (𝑔) ∈ 𝑥)
2524ralrimivva 3189 . . . . . . . . 9 ( [] Or 𝑥 → ∀𝑔𝑥𝑥 (𝑔) ∈ 𝑥)
2623, 25syl 17 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → ∀𝑔𝑥𝑥 (𝑔) ∈ 𝑥)
27 filuni 22485 . . . . . . . 8 ((𝑥 ⊆ (Fil‘𝑋) ∧ 𝑥 ≠ ∅ ∧ ∀𝑔𝑥𝑥 (𝑔) ∈ 𝑥) → 𝑥 ∈ (Fil‘𝑋))
2821, 22, 26, 27syl3anc 1366 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥 ∈ (Fil‘𝑋))
29 n0 4308 . . . . . . . . 9 (𝑥 ≠ ∅ ↔ ∃ 𝑥)
30 ssel2 3960 . . . . . . . . . . . . . 14 ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥) → ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔})
31 sseq2 3991 . . . . . . . . . . . . . . 15 (𝑔 = → (𝐹𝑔𝐹))
3231elrab 3678 . . . . . . . . . . . . . 14 ( ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ↔ ( ∈ (Fil‘𝑋) ∧ 𝐹))
3330, 32sylib 220 . . . . . . . . . . . . 13 ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥) → ( ∈ (Fil‘𝑋) ∧ 𝐹))
3433simprd 498 . . . . . . . . . . . 12 ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥) → 𝐹)
35 ssuni 4852 . . . . . . . . . . . 12 ((𝐹𝑥) → 𝐹 𝑥)
3634, 35sylancom 590 . . . . . . . . . . 11 ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥) → 𝐹 𝑥)
3736ex 415 . . . . . . . . . 10 (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} → (𝑥𝐹 𝑥))
3837exlimdv 1928 . . . . . . . . 9 (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} → (∃ 𝑥𝐹 𝑥))
3929, 38syl5bi 244 . . . . . . . 8 (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} → (𝑥 ≠ ∅ → 𝐹 𝑥))
4018, 22, 39sylc 65 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝐹 𝑥)
4117, 28, 40elrabd 3680 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥)) → 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔})
4241ex 415 . . . . 5 (𝐹 ∈ (Fil‘𝑋) → ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}))
4342alrimiv 1922 . . . 4 (𝐹 ∈ (Fil‘𝑋) → ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}))
4443adantr 483 . . 3 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}))
45 zornn0g 9919 . . 3 (({𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∈ dom card ∧ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ≠ ∅ ∧ ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ 𝑥 ≠ ∅ ∧ [] Or 𝑥) → 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔})) → ∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}∀ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ¬ 𝑓)
469, 16, 44, 45syl3anc 1366 . 2 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}∀ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ¬ 𝑓)
47 sseq2 3991 . . . . 5 (𝑔 = 𝑓 → (𝐹𝑔𝐹𝑓))
4847elrab 3678 . . . 4 (𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ↔ (𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓))
4931ralrab 3683 . . . 4 (∀ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ¬ 𝑓 ↔ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓))
50 simpll 765 . . . . . 6 (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → 𝑓 ∈ (Fil‘𝑋))
51 sstr2 3972 . . . . . . . . . . 11 (𝐹𝑓 → (𝑓𝐹))
5251imim1d 82 . . . . . . . . . 10 (𝐹𝑓 → ((𝐹 → ¬ 𝑓) → (𝑓 → ¬ 𝑓)))
53 df-pss 3952 . . . . . . . . . . . . 13 (𝑓 ↔ (𝑓𝑓))
5453simplbi2 503 . . . . . . . . . . . 12 (𝑓 → (𝑓𝑓))
5554necon1bd 3032 . . . . . . . . . . 11 (𝑓 → (¬ 𝑓𝑓 = ))
5655a2i 14 . . . . . . . . . 10 ((𝑓 → ¬ 𝑓) → (𝑓𝑓 = ))
5752, 56syl6 35 . . . . . . . . 9 (𝐹𝑓 → ((𝐹 → ¬ 𝑓) → (𝑓𝑓 = )))
5857ralimdv 3176 . . . . . . . 8 (𝐹𝑓 → (∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓) → ∀ ∈ (Fil‘𝑋)(𝑓𝑓 = )))
5958imp 409 . . . . . . 7 ((𝐹𝑓 ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → ∀ ∈ (Fil‘𝑋)(𝑓𝑓 = ))
6059adantll 712 . . . . . 6 (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → ∀ ∈ (Fil‘𝑋)(𝑓𝑓 = ))
61 isufil2 22508 . . . . . 6 (𝑓 ∈ (UFil‘𝑋) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀ ∈ (Fil‘𝑋)(𝑓𝑓 = )))
6250, 60, 61sylanbrc 585 . . . . 5 (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → 𝑓 ∈ (UFil‘𝑋))
63 simplr 767 . . . . 5 (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → 𝐹𝑓)
6462, 63jca 514 . . . 4 (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹𝑓) ∧ ∀ ∈ (Fil‘𝑋)(𝐹 → ¬ 𝑓)) → (𝑓 ∈ (UFil‘𝑋) ∧ 𝐹𝑓))
6548, 49, 64syl2anb 599 . . 3 ((𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ∧ ∀ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ¬ 𝑓) → (𝑓 ∈ (UFil‘𝑋) ∧ 𝐹𝑓))
6665reximi2 3242 . 2 (∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔}∀ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹𝑔} ¬ 𝑓 → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
6746, 66syl 17 1 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ (UFil‘𝑋)𝐹𝑓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  w3a 1082  wal 1529  wex 1774  wcel 2108  wne 3014  wral 3136  wrex 3137  {crab 3140  cun 3932  wss 3934  wpss 3935  c0 4289  𝒫 cpw 4537   cuni 4830   Or wor 5466  dom cdm 5548  cfv 6348   [] crpss 7440  cardccrd 9356  Filcfil 22445  UFilcufil 22499
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-se 5508  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-isom 6357  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-rpss 7441  df-om 7573  df-1st 7681  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-1o 8094  df-oadd 8098  df-er 8281  df-en 8502  df-dom 8503  df-fin 8505  df-fi 8867  df-dju 9322  df-card 9360  df-fbas 20534  df-fg 20535  df-fil 22446  df-ufil 22501
This theorem is referenced by:  filssufil  22512  numufl  22515
  Copyright terms: Public domain W3C validator