| 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 6895 | . . . . 5 ⊢ (∏t‘𝐹) ∈ V | |
| 2 | 1 | uniex 7740 | . . . 4 ⊢ ∪ (∏t‘𝐹) ∈ V |
| 3 | axac3 10448 | . . . . 5 ⊢ CHOICE | |
| 4 | acufl 24043 | . . . . 5 ⊢ (CHOICE → UFL = V) | |
| 5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ UFL = V |
| 6 | 2, 5 | eleqtrri 2868 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ UFL |
| 7 | cardeqv 10453 | . . . 4 ⊢ dom card = V | |
| 8 | 2, 7 | eleqtrri 2868 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ dom card |
| 9 | 6, 8 | elini 4160 | . 2 ⊢ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card) |
| 10 | eqid 2769 | . . 3 ⊢ (∏t‘𝐹) = (∏t‘𝐹) | |
| 11 | eqid 2769 | . . 3 ⊢ ∪ (∏t‘𝐹) = ∪ (∏t‘𝐹) | |
| 12 | 10, 11 | ptcmpg 24183 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card)) → (∏t‘𝐹) ∈ Comp) |
| 13 | 9, 12 | mp3an3 1476 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp) → (∏t‘𝐹) ∈ Comp) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∩ cin 3912 ∪ cuni 4876 dom cdm 5662 ⟶wf 6533 ‘cfv 6537 cardccrd 9921 CHOICEwac 10099 ∏tcpt 17491 Compccmp 23512 UFLcufl 24026 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-ac2 10447 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-rpss 7721 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-oadd 8457 df-omul 8458 df-er 8694 df-map 8826 df-ixp 8896 df-en 8944 df-dom 8945 df-fin 8947 df-fi 9371 df-wdom 9527 df-dju 9887 df-card 9925 df-acn 9928 df-ac 10100 df-topgen 17496 df-pt 17497 df-fbas 21488 df-fg 21489 df-top 23020 df-topon 23037 df-bases 23072 df-cld 23145 df-ntr 23146 df-cls 23147 df-nei 23224 df-cmp 23513 df-fil 23972 df-ufil 24027 df-ufl 24028 df-flim 24065 df-fcls 24067 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |