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

Theorem alexsubALTlem1 24055
Description: Lemma for alexsubALT 24059. 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 23403 . . 3 (𝐽 ∈ Comp → 𝐽 ∈ Top)
2 fitop 22906 . . . . 5 (𝐽 ∈ Top → (fi‘𝐽) = 𝐽)
32fveq2d 6910 . . . 4 (𝐽 ∈ Top → (topGen‘(fi‘𝐽)) = (topGen‘𝐽))
4 tgtop 22980 . . . 4 (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
53, 4eqtr2d 2778 . . 3 (𝐽 ∈ Top → 𝐽 = (topGen‘(fi‘𝐽)))
61, 5syl 17 . 2 (𝐽 ∈ Comp → 𝐽 = (topGen‘(fi‘𝐽)))
7 velpw 4605 . . . 4 (𝑐 ∈ 𝒫 𝐽𝑐𝐽)
8 alexsubALT.1 . . . . . 6 𝑋 = 𝐽
98cmpcov 23397 . . . . 5 ((𝐽 ∈ Comp ∧ 𝑐𝐽𝑋 = 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)
1093exp 1120 . . . 4 (𝐽 ∈ Comp → (𝑐𝐽 → (𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
117, 10biimtrid 242 . . 3 (𝐽 ∈ Comp → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
1211ralrimiv 3145 . 2 (𝐽 ∈ Comp → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))
13 2fveq3 6911 . . . . 5 (𝑥 = 𝐽 → (topGen‘(fi‘𝑥)) = (topGen‘(fi‘𝐽)))
1413eqeq2d 2748 . . . 4 (𝑥 = 𝐽 → (𝐽 = (topGen‘(fi‘𝑥)) ↔ 𝐽 = (topGen‘(fi‘𝐽))))
15 pweq 4614 . . . . 5 (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
1615raleqdv 3326 . . . 4 (𝑥 = 𝐽 → (∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑) ↔ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
1714, 16anbi12d 632 . . 3 (𝑥 = 𝐽 → ((𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)) ↔ (𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))))
1817spcegv 3597 . 2 (𝐽 ∈ Comp → ((𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)) → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑))))
196, 12, 18mp2and 699 1 (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = 𝑑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wex 1779  wcel 2108  wral 3061  wrex 3070  cin 3950  wss 3951  𝒫 cpw 4600   cuni 4907  cfv 6561  Fincfn 8985  ficfi 9450  topGenctg 17482  Topctop 22899  Compccmp 23394
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-om 7888  df-1o 8506  df-2o 8507  df-en 8986  df-fin 8989  df-fi 9451  df-topgen 17488  df-top 22900  df-cmp 23395
This theorem is referenced by:  alexsubALT  24059
  Copyright terms: Public domain W3C validator