MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ptcmpg Structured version   Visualization version   Unicode version

Theorem ptcmpg 21150
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  ~P ~P X is well-orderable, so if we assume the Axiom of Choice we can eliminate them (see ptcmp 21151). (Contributed by Mario Carneiro, 27-Aug-2015.)
Hypotheses
Ref Expression
ptcmpg.1  |-  J  =  ( Xt_ `  F
)
ptcmpg.2  |-  X  = 
U. J
Assertion
Ref Expression
ptcmpg  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  J  e.  Comp )

Proof of Theorem ptcmpg
Dummy variables  a 
b  k  m  n  u  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ptcmpg.1 . 2  |-  J  =  ( Xt_ `  F
)
2 nfcv 2612 . . . 4  |-  F/_ k
( F `  a
)
3 nfcv 2612 . . . 4  |-  F/_ a
( F `  k
)
4 nfcv 2612 . . . 4  |-  F/_ k
( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  a ) ) "
b )
5 nfcv 2612 . . . 4  |-  F/_ u
( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  a ) ) "
b )
6 nfcv 2612 . . . 4  |-  F/_ a
( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
u )
7 nfcv 2612 . . . 4  |-  F/_ b
( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
u )
8 fveq2 5879 . . . 4  |-  ( a  =  k  ->  ( F `  a )  =  ( F `  k ) )
9 fveq2 5879 . . . . . . . 8  |-  ( a  =  k  ->  (
w `  a )  =  ( w `  k ) )
109mpteq2dv 4483 . . . . . . 7  |-  ( a  =  k  ->  (
w  e.  X_ n  e.  A  U. ( F `  n )  |->  ( w `  a
) )  =  ( w  e.  X_ n  e.  A  U. ( F `  n )  |->  ( w `  k
) ) )
1110cnveqd 5015 . . . . . 6  |-  ( a  =  k  ->  `' ( w  e.  X_ n  e.  A  U. ( F `  n )  |->  ( w `  a
) )  =  `' ( w  e.  X_ n  e.  A  U. ( F `  n )  |->  ( w `  k
) ) )
1211imaeq1d 5173 . . . . 5  |-  ( a  =  k  ->  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  a ) ) "
b )  =  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
b ) )
13 imaeq2 5170 . . . . 5  |-  ( b  =  u  ->  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
b )  =  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
u ) )
1412, 13sylan9eq 2525 . . . 4  |-  ( ( a  =  k  /\  b  =  u )  ->  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  a ) ) "
b )  =  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n
)  |->  ( w `  k ) ) "
u ) )
152, 3, 4, 5, 6, 7, 8, 14cbvmpt2x 6388 . . 3  |-  ( a  e.  A ,  b  e.  ( F `  a )  |->  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n ) 
|->  ( w `  a
) ) " b
) )  =  ( k  e.  A ,  u  e.  ( F `  k )  |->  ( `' ( w  e.  X_ n  e.  A  U. ( F `  n ) 
|->  ( w `  k
) ) " u
) )
16 fveq2 5879 . . . . 5  |-  ( n  =  m  ->  ( F `  n )  =  ( F `  m ) )
1716unieqd 4200 . . . 4  |-  ( n  =  m  ->  U. ( F `  n )  =  U. ( F `  m ) )
1817cbvixpv 7558 . . 3  |-  X_ n  e.  A  U. ( F `  n )  =  X_ m  e.  A  U. ( F `  m
)
19 simp1 1030 . . 3  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  A  e.  V )
20 simp2 1031 . . 3  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  F : A
--> Comp )
21 cmptop 20487 . . . . . . . 8  |-  ( k  e.  Comp  ->  k  e. 
Top )
2221ssriv 3422 . . . . . . 7  |-  Comp  C_  Top
23 fss 5749 . . . . . . 7  |-  ( ( F : A --> Comp  /\  Comp  C_ 
Top )  ->  F : A --> Top )
2420, 22, 23sylancl 675 . . . . . 6  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  F : A
--> Top )
251ptuni 20686 . . . . . 6  |-  ( ( A  e.  V  /\  F : A --> Top )  -> 
X_ n  e.  A  U. ( F `  n
)  =  U. J
)
2619, 24, 25syl2anc 673 . . . . 5  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  X_ n  e.  A  U. ( F `
 n )  = 
U. J )
27 ptcmpg.2 . . . . 5  |-  X  = 
U. J
2826, 27syl6eqr 2523 . . . 4  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  X_ n  e.  A  U. ( F `
 n )  =  X )
29 simp3 1032 . . . 4  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  X  e.  (UFL  i^i  dom  card ) )
3028, 29eqeltrd 2549 . . 3  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  X_ n  e.  A  U. ( F `
 n )  e.  (UFL  i^i  dom  card )
)
3115, 18, 19, 20, 30ptcmplem5 21149 . 2  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  ( Xt_ `  F )  e.  Comp )
321, 31syl5eqel 2553 1  |-  ( ( A  e.  V  /\  F : A --> Comp  /\  X  e.  (UFL  i^i  dom  card )
)  ->  J  e.  Comp )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ w3a 1007    = wceq 1452    e. wcel 1904    i^i cin 3389    C_ wss 3390   U.cuni 4190    |-> cmpt 4454   `'ccnv 4838   dom cdm 4839   "cima 4842   -->wf 5585   ` cfv 5589    |-> cmpt2 6310   X_cixp 7540   cardccrd 8387   Xt_cpt 15415   Topctop 19994   Compccmp 20478  UFLcufl 20993
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-rep 4508  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-nel 2644  df-ral 2761  df-rex 2762  df-reu 2763  df-rmo 2764  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-int 4227  df-iun 4271  df-iin 4272  df-br 4396  df-opab 4455  df-mpt 4456  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-se 4799  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-pred 5387  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-isom 5598  df-riota 6270  df-ov 6311  df-oprab 6312  df-mpt2 6313  df-om 6712  df-1st 6812  df-2nd 6813  df-wrecs 7046  df-recs 7108  df-rdg 7146  df-1o 7200  df-2o 7201  df-oadd 7204  df-omul 7205  df-er 7381  df-map 7492  df-ixp 7541  df-en 7588  df-dom 7589  df-sdom 7590  df-fin 7591  df-fi 7943  df-wdom 8092  df-card 8391  df-acn 8394  df-topgen 15420  df-pt 15421  df-fbas 19044  df-fg 19045  df-top 19998  df-bases 19999  df-topon 20000  df-cld 20111  df-ntr 20112  df-cls 20113  df-nei 20191  df-cmp 20479  df-fil 20939  df-ufil 20994  df-ufl 20995  df-flim 21032  df-fcls 21034
This theorem is referenced by:  ptcmp  21151  dfac21  35995
  Copyright terms: Public domain W3C validator