![]() |
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 6902 | . . . . 5 ⊢ (∏t‘𝐹) ∈ V | |
2 | 1 | uniex 7728 | . . . 4 ⊢ ∪ (∏t‘𝐹) ∈ V |
3 | axac3 10456 | . . . . 5 ⊢ CHOICE | |
4 | acufl 23413 | . . . . 5 ⊢ (CHOICE → UFL = V) | |
5 | 3, 4 | ax-mp 5 | . . . 4 ⊢ UFL = V |
6 | 2, 5 | eleqtrri 2833 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ UFL |
7 | cardeqv 10461 | . . . 4 ⊢ dom card = V | |
8 | 2, 7 | eleqtrri 2833 | . . 3 ⊢ ∪ (∏t‘𝐹) ∈ dom card |
9 | 6, 8 | elini 4193 | . 2 ⊢ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card) |
10 | eqid 2733 | . . 3 ⊢ (∏t‘𝐹) = (∏t‘𝐹) | |
11 | eqid 2733 | . . 3 ⊢ ∪ (∏t‘𝐹) = ∪ (∏t‘𝐹) | |
12 | 10, 11 | ptcmpg 23553 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp ∧ ∪ (∏t‘𝐹) ∈ (UFL ∩ dom card)) → (∏t‘𝐹) ∈ Comp) |
13 | 9, 12 | mp3an3 1451 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Comp) → (∏t‘𝐹) ∈ Comp) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3475 ∩ cin 3947 ∪ cuni 4908 dom cdm 5676 ⟶wf 6537 ‘cfv 6541 cardccrd 9927 CHOICEwac 10107 ∏tcpt 17381 Compccmp 22882 UFLcufl 23396 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-ac2 10455 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-rpss 7710 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-oadd 8467 df-omul 8468 df-er 8700 df-map 8819 df-ixp 8889 df-en 8937 df-dom 8938 df-fin 8940 df-fi 9403 df-wdom 9557 df-dju 9893 df-card 9931 df-acn 9934 df-ac 10108 df-topgen 17386 df-pt 17387 df-fbas 20934 df-fg 20935 df-top 22388 df-topon 22405 df-bases 22441 df-cld 22515 df-ntr 22516 df-cls 22517 df-nei 22594 df-cmp 22883 df-fil 23342 df-ufil 23397 df-ufl 23398 df-flim 23435 df-fcls 23437 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |