Theorem alexsubALTlem1 24204

Description: Lemma for alexsubALT 24208. 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

Step	Hyp	Ref	Expression
1		cmptop 23552	. . 3 ⊢ (𝐽 ∈ Comp → 𝐽 ∈ Top)
2		fitop 23057	. . . . 5 ⊢ (𝐽 ∈ Top → (fi‘𝐽) = 𝐽)
3	2	fveq2d 6885	. . . 4 ⊢ (𝐽 ∈ Top → (topGen‘(fi‘𝐽)) = (topGen‘𝐽))
4		tgtop 23130	. . . 4 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽)
5	3, 4	eqtr2d 2799	. . 3 ⊢ (𝐽 ∈ Top → 𝐽 = (topGen‘(fi‘𝐽)))
6	1, 5	syl 18	. 2 ⊢ (𝐽 ∈ Comp → 𝐽 = (topGen‘(fi‘𝐽)))
7		velpw 4567	. . . 4 ⊢ (𝑐 ∈ 𝒫 𝐽 ↔ 𝑐 ⊆ 𝐽)
8		alexsubALT.1	. . . . . 6 ⊢ 𝑋 = ∪ 𝐽
9	8	cmpcov 23546	. . . . 5 ⊢ ((𝐽 ∈ Comp ∧ 𝑐 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑐) → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)
10	9	3exp 1137	. . . 4 ⊢ (𝐽 ∈ Comp → (𝑐 ⊆ 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
11	7, 10	biimtrid 245	. . 3 ⊢ (𝐽 ∈ Comp → (𝑐 ∈ 𝒫 𝐽 → (𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
12	11	ralrimiv 3156	. 2 ⊢ (𝐽 ∈ Comp → ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))
13		2fveq3 6886	. . . . 5 ⊢ (𝑥 = 𝐽 → (topGen‘(fi‘𝑥)) = (topGen‘(fi‘𝐽)))
14	13	eqeq2d 2774	. . . 4 ⊢ (𝑥 = 𝐽 → (𝐽 = (topGen‘(fi‘𝑥)) ↔ 𝐽 = (topGen‘(fi‘𝐽))))
15		pweq 4576	. . . . 5 ⊢ (𝑥 = 𝐽 → 𝒫 𝑥 = 𝒫 𝐽)
16	15	raleqdv 3323	. . . 4 ⊢ (𝑥 = 𝐽 → (∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑) ↔ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))
17	14, 16	anbi12d 643	. . 3 ⊢ (𝑥 = 𝐽 → ((𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)) ↔ (𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))))
18	17	spcegv 3556	. 2 ⊢ (𝐽 ∈ Comp → ((𝐽 = (topGen‘(fi‘𝐽)) ∧ ∀𝑐 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)) → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑))))
19	6, 12, 18	mp2and 711	1 ⊢ (𝐽 ∈ Comp → ∃𝑥(𝐽 = (topGen‘(fi‘𝑥)) ∧ ∀𝑐 ∈ 𝒫 𝑥(𝑋 = ∪ 𝑐 → ∃𝑑 ∈ (𝒫 𝑐 ∩ Fin)𝑋 = ∪ 𝑑)))

Syntax hints:   → wi 4   ∧ wa 400   = wceq 1570  ∃wex 1809   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ∩ cin 3904   ⊆ wss 3905  𝒫 cpw 4562  ∪ cuni 4872  ‘cfv 6536  Fincfn 8939  ficfi 9366  topGenctg 17485  Topctop 23050  Compccmp 23543

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7859  df-1o 8449  df-2o 8450  df-en 8940  df-fin 8943  df-fi 9367  df-topgen 17491  df-top 23051  df-cmp 23544

This theorem is referenced by:  alexsubALT  24208