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

Theorem alexsubb 23185
Description: Biconditional form of the Alexander Subbase Theorem alexsub 23184. (Contributed by Mario Carneiro, 27-Aug-2015.)
Assertion
Ref Expression
alexsubb ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑋,𝑦

Proof of Theorem alexsubb
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2738 . . . . 5 (topGen‘(fi‘𝐵)) = (topGen‘(fi‘𝐵))
21iscmp 22527 . . . 4 ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ((topGen‘(fi‘𝐵)) ∈ Top ∧ ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))( (topGen‘(fi‘𝐵)) = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦)))
32simprbi 497 . . 3 ((topGen‘(fi‘𝐵)) ∈ Comp → ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))( (topGen‘(fi‘𝐵)) = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦))
4 simpr 485 . . . . . . . . . . 11 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝑋 = 𝐵)
5 elex 3448 . . . . . . . . . . . 12 (𝑋 ∈ UFL → 𝑋 ∈ V)
65adantr 481 . . . . . . . . . . 11 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝑋 ∈ V)
74, 6eqeltrrd 2840 . . . . . . . . . 10 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝐵 ∈ V)
8 uniexb 7605 . . . . . . . . . 10 (𝐵 ∈ V ↔ 𝐵 ∈ V)
97, 8sylibr 233 . . . . . . . . 9 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝐵 ∈ V)
10 fiuni 9175 . . . . . . . . 9 (𝐵 ∈ V → 𝐵 = (fi‘𝐵))
119, 10syl 17 . . . . . . . 8 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝐵 = (fi‘𝐵))
12 fibas 22115 . . . . . . . . 9 (fi‘𝐵) ∈ TopBases
13 unitg 22105 . . . . . . . . 9 ((fi‘𝐵) ∈ TopBases → (topGen‘(fi‘𝐵)) = (fi‘𝐵))
1412, 13mp1i 13 . . . . . . . 8 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (topGen‘(fi‘𝐵)) = (fi‘𝐵))
1511, 4, 143eqtr4d 2788 . . . . . . 7 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝑋 = (topGen‘(fi‘𝐵)))
1615eqeq1d 2740 . . . . . 6 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (𝑋 = 𝑥 (topGen‘(fi‘𝐵)) = 𝑥))
1715eqeq1d 2740 . . . . . . 7 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (𝑋 = 𝑦 (topGen‘(fi‘𝐵)) = 𝑦))
1817rexbidv 3224 . . . . . 6 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦 ↔ ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦))
1916, 18imbi12d 345 . . . . 5 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → ((𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) ↔ ( (topGen‘(fi‘𝐵)) = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦)))
2019ralbidv 3108 . . . 4 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) ↔ ∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))( (topGen‘(fi‘𝐵)) = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦)))
21 ssfii 9166 . . . . . . . 8 (𝐵 ∈ V → 𝐵 ⊆ (fi‘𝐵))
229, 21syl 17 . . . . . . 7 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝐵 ⊆ (fi‘𝐵))
23 bastg 22104 . . . . . . . 8 ((fi‘𝐵) ∈ TopBases → (fi‘𝐵) ⊆ (topGen‘(fi‘𝐵)))
2412, 23ax-mp 5 . . . . . . 7 (fi‘𝐵) ⊆ (topGen‘(fi‘𝐵))
2522, 24sstrdi 3933 . . . . . 6 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝐵 ⊆ (topGen‘(fi‘𝐵)))
2625sspwd 4549 . . . . 5 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → 𝒫 𝐵 ⊆ 𝒫 (topGen‘(fi‘𝐵)))
27 ssralv 3987 . . . . 5 (𝒫 𝐵 ⊆ 𝒫 (topGen‘(fi‘𝐵)) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
2826, 27syl 17 . . . 4 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
2920, 28sylbird 259 . . 3 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (∀𝑥 ∈ 𝒫 (topGen‘(fi‘𝐵))( (topGen‘(fi‘𝐵)) = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin) (topGen‘(fi‘𝐵)) = 𝑦) → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
303, 29syl5 34 . 2 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp → ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
31 simpll 764 . . . 4 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → 𝑋 ∈ UFL)
32 simplr 766 . . . 4 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → 𝑋 = 𝐵)
33 eqidd 2739 . . . 4 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → (topGen‘(fi‘𝐵)) = (topGen‘(fi‘𝐵)))
34 velpw 4539 . . . . . . 7 (𝑧 ∈ 𝒫 𝐵𝑧𝐵)
35 unieq 4851 . . . . . . . . . . 11 (𝑥 = 𝑧 𝑥 = 𝑧)
3635eqeq2d 2749 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝑋 = 𝑥𝑋 = 𝑧))
37 pweq 4550 . . . . . . . . . . . 12 (𝑥 = 𝑧 → 𝒫 𝑥 = 𝒫 𝑧)
3837ineq1d 4146 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝒫 𝑥 ∩ Fin) = (𝒫 𝑧 ∩ Fin))
3938rexeqdv 3347 . . . . . . . . . 10 (𝑥 = 𝑧 → (∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦 ↔ ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦))
4036, 39imbi12d 345 . . . . . . . . 9 (𝑥 = 𝑧 → ((𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) ↔ (𝑋 = 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦)))
4140rspccv 3557 . . . . . . . 8 (∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) → (𝑧 ∈ 𝒫 𝐵 → (𝑋 = 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦)))
4241adantl 482 . . . . . . 7 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → (𝑧 ∈ 𝒫 𝐵 → (𝑋 = 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦)))
4334, 42syl5bir 242 . . . . . 6 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → (𝑧𝐵 → (𝑋 = 𝑧 → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦)))
4443imp32 419 . . . . 5 ((((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) ∧ (𝑧𝐵𝑋 = 𝑧)) → ∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦)
45 unieq 4851 . . . . . . 7 (𝑦 = 𝑤 𝑦 = 𝑤)
4645eqeq2d 2749 . . . . . 6 (𝑦 = 𝑤 → (𝑋 = 𝑦𝑋 = 𝑤))
4746cbvrexvw 3382 . . . . 5 (∃𝑦 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑦 ↔ ∃𝑤 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑤)
4844, 47sylib 217 . . . 4 ((((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) ∧ (𝑧𝐵𝑋 = 𝑧)) → ∃𝑤 ∈ (𝒫 𝑧 ∩ Fin)𝑋 = 𝑤)
4931, 32, 33, 48alexsub 23184 . . 3 (((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) ∧ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)) → (topGen‘(fi‘𝐵)) ∈ Comp)
5049ex 413 . 2 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → (∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦) → (topGen‘(fi‘𝐵)) ∈ Comp))
5130, 50impbid 211 1 ((𝑋 ∈ UFL ∧ 𝑋 = 𝐵) → ((topGen‘(fi‘𝐵)) ∈ Comp ↔ ∀𝑥 ∈ 𝒫 𝐵(𝑋 = 𝑥 → ∃𝑦 ∈ (𝒫 𝑥 ∩ Fin)𝑋 = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  wrex 3065  Vcvv 3430  cin 3886  wss 3887  𝒫 cpw 4534   cuni 4840  cfv 6427  Fincfn 8721  ficfi 9157  topGenctg 17136  Topctop 22030  TopBasesctb 22083  Compccmp 22525  UFLcufl 23039
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5222  ax-nul 5229  ax-pow 5287  ax-pr 5351  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3071  df-rab 3073  df-v 3432  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4258  df-if 4461  df-pw 4536  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4841  df-int 4881  df-iun 4927  df-iin 4928  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5485  df-eprel 5491  df-po 5499  df-so 5500  df-fr 5540  df-we 5542  df-xp 5591  df-rel 5592  df-cnv 5593  df-co 5594  df-dm 5595  df-rn 5596  df-res 5597  df-ima 5598  df-ord 6263  df-on 6264  df-lim 6265  df-suc 6266  df-iota 6385  df-fun 6429  df-fn 6430  df-f 6431  df-f1 6432  df-fo 6433  df-f1o 6434  df-fv 6435  df-ov 7271  df-oprab 7272  df-mpo 7273  df-om 7704  df-1st 7821  df-2nd 7822  df-1o 8285  df-er 8486  df-en 8722  df-dom 8723  df-fin 8725  df-fi 9158  df-topgen 17142  df-fbas 20582  df-fg 20583  df-top 22031  df-topon 22048  df-bases 22084  df-cld 22158  df-ntr 22159  df-cls 22160  df-nei 22237  df-cmp 22526  df-fil 22985  df-ufil 23040  df-ufl 23041  df-flim 23078  df-fcls 23080
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator