![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ptcmpg | Structured version Visualization version GIF version |
Description: Tychonoff's theorem: The product of compact spaces is compact. The choice principles needed are encoded in the last hypothesis: the base set of the product must be well-orderable and satisfy the ultrafilter lemma. Both these assumptions are satisfied if 𝒫 𝒫 𝑋 is well-orderable, so if we assume the Axiom of Choice we can eliminate them (see ptcmp 22364). (Contributed by Mario Carneiro, 27-Aug-2015.) |
Ref | Expression |
---|---|
ptcmpg.1 | ⊢ 𝐽 = (∏t‘𝐹) |
ptcmpg.2 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
ptcmpg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝐽 ∈ Comp) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ptcmpg.1 | . 2 ⊢ 𝐽 = (∏t‘𝐹) | |
2 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑘(𝐹‘𝑎) | |
3 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑎(𝐹‘𝑘) | |
4 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑘(◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) “ 𝑏) | |
5 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑢(◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) “ 𝑏) | |
6 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑎(◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢) | |
7 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑏(◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢) | |
8 | fveq2 6493 | . . . 4 ⊢ (𝑎 = 𝑘 → (𝐹‘𝑎) = (𝐹‘𝑘)) | |
9 | fveq2 6493 | . . . . . . . 8 ⊢ (𝑎 = 𝑘 → (𝑤‘𝑎) = (𝑤‘𝑘)) | |
10 | 9 | mpteq2dv 5017 | . . . . . . 7 ⊢ (𝑎 = 𝑘 → (𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) = (𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘))) |
11 | 10 | cnveqd 5590 | . . . . . 6 ⊢ (𝑎 = 𝑘 → ◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) = ◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘))) |
12 | 11 | imaeq1d 5763 | . . . . 5 ⊢ (𝑎 = 𝑘 → (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) “ 𝑏) = (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑏)) |
13 | imaeq2 5760 | . . . . 5 ⊢ (𝑏 = 𝑢 → (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑏) = (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) | |
14 | 12, 13 | sylan9eq 2828 | . . . 4 ⊢ ((𝑎 = 𝑘 ∧ 𝑏 = 𝑢) → (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) “ 𝑏) = (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) |
15 | 2, 3, 4, 5, 6, 7, 8, 14 | cbvmpox 7057 | . . 3 ⊢ (𝑎 ∈ 𝐴, 𝑏 ∈ (𝐹‘𝑎) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑎)) “ 𝑏)) = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) |
16 | fveq2 6493 | . . . . 5 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚)) | |
17 | 16 | unieqd 4716 | . . . 4 ⊢ (𝑛 = 𝑚 → ∪ (𝐹‘𝑛) = ∪ (𝐹‘𝑚)) |
18 | 17 | cbvixpv 8271 | . . 3 ⊢ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = X𝑚 ∈ 𝐴 ∪ (𝐹‘𝑚) |
19 | simp1 1116 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝐴 ∈ 𝑉) | |
20 | simp2 1117 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝐹:𝐴⟶Comp) | |
21 | cmptop 21701 | . . . . . . . 8 ⊢ (𝑘 ∈ Comp → 𝑘 ∈ Top) | |
22 | 21 | ssriv 3856 | . . . . . . 7 ⊢ Comp ⊆ Top |
23 | fss 6351 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶Comp ∧ Comp ⊆ Top) → 𝐹:𝐴⟶Top) | |
24 | 20, 22, 23 | sylancl 577 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝐹:𝐴⟶Top) |
25 | 1 | ptuni 21900 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = ∪ 𝐽) |
26 | 19, 24, 25 | syl2anc 576 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = ∪ 𝐽) |
27 | ptcmpg.2 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
28 | 26, 27 | syl6eqr 2826 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋) |
29 | simp3 1118 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝑋 ∈ (UFL ∩ dom card)) | |
30 | 28, 29 | eqeltrd 2860 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ∈ (UFL ∩ dom card)) |
31 | 15, 18, 19, 20, 30 | ptcmplem5 22362 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → (∏t‘𝐹) ∈ Comp) |
32 | 1, 31 | syl5eqel 2864 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ 𝑋 ∈ (UFL ∩ dom card)) → 𝐽 ∈ Comp) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1068 = wceq 1507 ∈ wcel 2050 ∩ cin 3822 ⊆ wss 3823 ∪ cuni 4706 ↦ cmpt 5002 ◡ccnv 5400 dom cdm 5401 “ cima 5404 ⟶wf 6178 ‘cfv 6182 ∈ cmpo 6972 Xcixp 8253 cardccrd 9152 ∏tcpt 16562 Topctop 21199 Compccmp 21692 UFLcufl 22206 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2744 ax-rep 5043 ax-sep 5054 ax-nul 5061 ax-pow 5113 ax-pr 5180 ax-un 7273 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2753 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ne 2962 df-nel 3068 df-ral 3087 df-rex 3088 df-reu 3089 df-rmo 3090 df-rab 3091 df-v 3411 df-sbc 3676 df-csb 3781 df-dif 3826 df-un 3828 df-in 3830 df-ss 3837 df-pss 3839 df-nul 4173 df-if 4345 df-pw 4418 df-sn 4436 df-pr 4438 df-tp 4440 df-op 4442 df-uni 4707 df-int 4744 df-iun 4788 df-iin 4789 df-br 4924 df-opab 4986 df-mpt 5003 df-tr 5025 df-id 5306 df-eprel 5311 df-po 5320 df-so 5321 df-fr 5360 df-se 5361 df-we 5362 df-xp 5407 df-rel 5408 df-cnv 5409 df-co 5410 df-dm 5411 df-rn 5412 df-res 5413 df-ima 5414 df-pred 5980 df-ord 6026 df-on 6027 df-lim 6028 df-suc 6029 df-iota 6146 df-fun 6184 df-fn 6185 df-f 6186 df-f1 6187 df-fo 6188 df-f1o 6189 df-fv 6190 df-isom 6191 df-riota 6931 df-ov 6973 df-oprab 6974 df-mpo 6975 df-om 7391 df-1st 7495 df-2nd 7496 df-wrecs 7744 df-recs 7806 df-rdg 7844 df-1o 7899 df-2o 7900 df-oadd 7903 df-omul 7904 df-er 8083 df-map 8202 df-ixp 8254 df-en 8301 df-dom 8302 df-sdom 8303 df-fin 8304 df-fi 8664 df-wdom 8812 df-card 9156 df-acn 9159 df-topgen 16567 df-pt 16568 df-fbas 20238 df-fg 20239 df-top 21200 df-topon 21217 df-bases 21252 df-cld 21325 df-ntr 21326 df-cls 21327 df-nei 21404 df-cmp 21693 df-fil 22152 df-ufil 22207 df-ufl 22208 df-flim 22245 df-fcls 22247 |
This theorem is referenced by: ptcmp 22364 dfac21 39062 |
Copyright terms: Public domain | W3C validator |