| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ptcmp | Structured version Visualization version GIF version | ||
| Description: Tychonoff's theorem: The product of compact spaces is compact. The proof uses the Axiom of Choice. (Contributed by Mario Carneiro, 26-Aug-2015.) |
| Ref | Expression |
|---|---|
| ptcmp | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp) → (∏t‘𝐹) ∈ Comp) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6880 | . . . . 5 ⊢ (∏t‘𝐹) ∈ V | |
| 2 | 1 | uniex 7724 | . . . 4 ⊢ ∪ (∏t‘𝐹) ∈ V |
| 3 | axac3 10421 | . . . . 5 ⊢ CHOICE | |
| 4 | acufl 23977 | . . . . 5 ⊢ (CHOICE → UFL = V) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ UFL = V |
| 6 | 2, 5 | eleqtrri 2861 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ UFL |
| 7 | cardeqv 10426 | . . . 4 ⊢ dom card = V | |
| 8 | 2, 7 | eleqtrri 2861 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ dom card |
| 9 | 6, 8 | elini 4151 | . 2 ⊢ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card) |
| 10 | eqid 2762 | . . 3 ⊢ (∏t‘𝐹) = (∏t‘𝐹) | |
| 11 | eqid 2762 | . . 3 ⊢ ∪ (∏t‘𝐹) = ∪ (∏t‘𝐹) | |
| 12 | 10, 11 | ptcmpg 24117 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card)) → (∏t‘𝐹) ∈ Comp) |
| 13 | 9, 12 | mp3an3 1471 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp) → (∏t‘𝐹) ∈ Comp) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∩ cin 3903 ∪ cuni 4865 dom cdm 5647 ⟶wf 6517 ‘cfv 6521 cardccrd 9893 CHOICEwac 10071 ∏tcpt 17467 Compccmp 23446 UFLcufl 23960 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-ac2 10420 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-rpss 7706 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-oadd 8441 df-omul 8442 df-er 8678 df-map 8810 df-ixp 8880 df-en 8928 df-dom 8929 df-fin 8931 df-fi 9357 df-wdom 9513 df-dju 9859 df-card 9897 df-acn 9900 df-ac 10072 df-topgen 17472 df-pt 17473 df-fbas 21421 df-fg 21422 df-top 22954 df-topon 22971 df-bases 23006 df-cld 23079 df-ntr 23080 df-cls 23081 df-nei 23158 df-cmp 23447 df-fil 23906 df-ufil 23961 df-ufl 23962 df-flim 23999 df-fcls 24001 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |