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

Theorem alexsubALTlem1 21764
 Description: Lemma for alexsubALT 21768. A compact space has a subbase such that every cover taken from it has a finite subcover. (Contributed by Jeff Hankins, 27-Jan-2010.)
Hypothesis
Ref Expression
alexsubALT.1 𝑋 = 𝐽
Assertion
Ref Expression
alexsubALTlem1 (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
Distinct variable groups:   𝑐,𝑑,𝑥,𝐽   𝑋,𝑐,𝑑,𝑥

Proof of Theorem alexsubALTlem1
StepHypRef Expression
1 cmptop 21111 . . 3 (𝐽 ∈ Comp → 𝐽 ∈ Top)
2 fitop 20627 . . . . 5 (𝐽 ∈ Top → (fi‘𝐽) = 𝐽)
32fveq2d 6154 . . . 4 (𝐽 ∈ Top → (topGen‘(fi‘𝐽)) = (topGen‘𝐽))
4 tgtop 20691 . . . 4 (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
53, 4eqtr2d 2656 . . 3 (𝐽 ∈ Top → 𝐽 = (topGen‘(fi‘𝐽)))
61, 5syl 17 . 2 (𝐽 ∈ Comp → 𝐽 = (topGen‘(fi‘𝐽)))
7 selpw 4139 . . . 4 (𝑐 ∈ 𝒫 𝐽𝑐𝐽)
8 alexsubALT.1 . . . . . 6 𝑋 = 𝐽
98cmpcov 21105 . . . . 5 ((𝐽 ∈ Comp ∧ 𝑐𝐽𝑋 = 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)
1093exp 1261 . . . 4 (𝐽 ∈ Comp → (𝑐𝐽 → (𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
117, 10syl5bi 232 . . 3 (𝐽 ∈ Comp → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
1211ralrimiv 2959 . 2 (𝐽 ∈ Comp → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))
13 fveq2 6150 . . . . . 6 (𝑥 = 𝐽 → (fi‘𝑥) = (fi‘𝐽))
1413fveq2d 6154 . . . . 5 (𝑥 = 𝐽 → (topGen‘(fi‘𝑥)) = (topGen‘(fi‘𝐽)))
1514eqeq2d 2631 . . . 4 (𝑥 = 𝐽 → (𝐽 = (topGen‘(fi‘𝑥)) ↔ 𝐽 = (topGen‘(fi‘𝐽))))
16 pweq 4135 . . . . 5 (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
1716raleqdv 3133 . . . 4 (𝑥 = 𝐽 → (∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑) ↔ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
1815, 17anbi12d 746 . . 3 (𝑥 = 𝐽 → ((𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)) ↔ (𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))))
1918spcegv 3280 . 2 (𝐽 ∈ Comp → ((𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)) → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))))
206, 12, 19mp2and 714 1 (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480  ∃wex 1701   ∈ wcel 1987  ∀wral 2907  ∃wrex 2908   ∩ cin 3555   ⊆ wss 3556  𝒫 cpw 4132  ∪ cuni 4404  ‘cfv 5849  Fincfn 7902  ficfi 8263  topGenctg 16022  Topctop 20620  Compccmp 21102 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pow 4805  ax-pr 4869  ax-un 6905 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3419  df-csb 3516  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-pss 3572  df-nul 3894  df-if 4061  df-pw 4134  df-sn 4151  df-pr 4153  df-tp 4155  df-op 4157  df-uni 4405  df-int 4443  df-iun 4489  df-br 4616  df-opab 4676  df-mpt 4677  df-tr 4715  df-eprel 4987  df-id 4991  df-po 4997  df-so 4998  df-fr 5035  df-we 5037  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-res 5088  df-ima 5089  df-pred 5641  df-ord 5687  df-on 5688  df-lim 5689  df-suc 5690  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-f1 5854  df-fo 5855  df-f1o 5856  df-fv 5857  df-ov 6610  df-oprab 6611  df-mpt2 6612  df-om 7016  df-wrecs 7355  df-recs 7416  df-rdg 7454  df-1o 7508  df-oadd 7512  df-er 7690  df-en 7903  df-fin 7906  df-fi 8264  df-topgen 16028  df-top 20621  df-cmp 21103 This theorem is referenced by:  alexsubALT  21768
 Copyright terms: Public domain W3C validator