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

Theorem ptcldmpt 17364
Description: A closed box in the product topology. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Hypotheses
Ref Expression
ptcldmpt.a  |-  ( ph  ->  A  e.  V )
ptcldmpt.j  |-  ( (
ph  /\  k  e.  A )  ->  J  e.  Top )
ptcldmpt.c  |-  ( (
ph  /\  k  e.  A )  ->  C  e.  ( Clsd `  J
) )
Assertion
Ref Expression
ptcldmpt  |-  ( ph  -> 
X_ k  e.  A  C  e.  ( Clsd `  ( Xt_ `  (
k  e.  A  |->  J ) ) ) )
Distinct variable groups:    ph, k    A, k
Allowed substitution hints:    C( k)    J( k)    V( k)

Proof of Theorem ptcldmpt
Dummy variable  l is distinct from all other variables.
StepHypRef Expression
1 nfcv 2452 . . 3  |-  F/_ l C
2 nfcsb1v 3147 . . 3  |-  F/_ k [_ l  /  k ]_ C
3 csbeq1a 3123 . . 3  |-  ( k  =  l  ->  C  =  [_ l  /  k ]_ C )
41, 2, 3cbvixp 6876 . 2  |-  X_ k  e.  A  C  =  X_ l  e.  A  [_ l  /  k ]_ C
5 ptcldmpt.a . . 3  |-  ( ph  ->  A  e.  V )
6 ptcldmpt.j . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  J  e.  Top )
7 eqid 2316 . . . 4  |-  ( k  e.  A  |->  J )  =  ( k  e.  A  |->  J )
86, 7fmptd 5722 . . 3  |-  ( ph  ->  ( k  e.  A  |->  J ) : A --> Top )
9 nfv 1610 . . . . 5  |-  F/ k ( ph  /\  l  e.  A )
10 nfcv 2452 . . . . . . 7  |-  F/_ k Clsd
11 nfmpt1 4146 . . . . . . . 8  |-  F/_ k
( k  e.  A  |->  J )
12 nfcv 2452 . . . . . . . 8  |-  F/_ k
l
1311, 12nffv 5570 . . . . . . 7  |-  F/_ k
( ( k  e.  A  |->  J ) `  l )
1410, 13nffv 5570 . . . . . 6  |-  F/_ k
( Clsd `  ( (
k  e.  A  |->  J ) `  l ) )
152, 14nfel 2460 . . . . 5  |-  F/ k
[_ l  /  k ]_ C  e.  ( Clsd `  ( ( k  e.  A  |->  J ) `
 l ) )
169, 15nfim 1792 . . . 4  |-  F/ k ( ( ph  /\  l  e.  A )  ->  [_ l  /  k ]_ C  e.  ( Clsd `  ( ( k  e.  A  |->  J ) `
 l ) ) )
17 eleq1 2376 . . . . . 6  |-  ( k  =  l  ->  (
k  e.  A  <->  l  e.  A ) )
1817anbi2d 684 . . . . 5  |-  ( k  =  l  ->  (
( ph  /\  k  e.  A )  <->  ( ph  /\  l  e.  A ) ) )
19 fveq2 5563 . . . . . . 7  |-  ( k  =  l  ->  (
( k  e.  A  |->  J ) `  k
)  =  ( ( k  e.  A  |->  J ) `  l ) )
2019fveq2d 5567 . . . . . 6  |-  ( k  =  l  ->  ( Clsd `  ( ( k  e.  A  |->  J ) `
 k ) )  =  ( Clsd `  (
( k  e.  A  |->  J ) `  l
) ) )
213, 20eleq12d 2384 . . . . 5  |-  ( k  =  l  ->  ( C  e.  ( Clsd `  ( ( k  e.  A  |->  J ) `  k ) )  <->  [_ l  / 
k ]_ C  e.  (
Clsd `  ( (
k  e.  A  |->  J ) `  l ) ) ) )
2218, 21imbi12d 311 . . . 4  |-  ( k  =  l  ->  (
( ( ph  /\  k  e.  A )  ->  C  e.  ( Clsd `  ( ( k  e.  A  |->  J ) `  k ) ) )  <-> 
( ( ph  /\  l  e.  A )  ->  [_ l  /  k ]_ C  e.  ( Clsd `  ( ( k  e.  A  |->  J ) `
 l ) ) ) ) )
23 ptcldmpt.c . . . . 5  |-  ( (
ph  /\  k  e.  A )  ->  C  e.  ( Clsd `  J
) )
24 simpr 447 . . . . . . 7  |-  ( (
ph  /\  k  e.  A )  ->  k  e.  A )
257fvmpt2 5646 . . . . . . 7  |-  ( ( k  e.  A  /\  J  e.  Top )  ->  ( ( k  e.  A  |->  J ) `  k )  =  J )
2624, 6, 25syl2anc 642 . . . . . 6  |-  ( (
ph  /\  k  e.  A )  ->  (
( k  e.  A  |->  J ) `  k
)  =  J )
2726fveq2d 5567 . . . . 5  |-  ( (
ph  /\  k  e.  A )  ->  ( Clsd `  ( ( k  e.  A  |->  J ) `
 k ) )  =  ( Clsd `  J
) )
2823, 27eleqtrrd 2393 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  C  e.  ( Clsd `  (
( k  e.  A  |->  J ) `  k
) ) )
2916, 22, 28chvar 1958 . . 3  |-  ( (
ph  /\  l  e.  A )  ->  [_ l  /  k ]_ C  e.  ( Clsd `  (
( k  e.  A  |->  J ) `  l
) ) )
305, 8, 29ptcld 17363 . 2  |-  ( ph  -> 
X_ l  e.  A  [_ l  /  k ]_ C  e.  ( Clsd `  ( Xt_ `  (
k  e.  A  |->  J ) ) ) )
314, 30syl5eqel 2400 1  |-  ( ph  -> 
X_ k  e.  A  C  e.  ( Clsd `  ( Xt_ `  (
k  e.  A  |->  J ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1633    e. wcel 1701   [_csb 3115    e. cmpt 4114   ` cfv 5292   X_cixp 6860   Xt_cpt 13392   Topctop 16687   Clsdccld 16809
This theorem is referenced by:  ptclsg  17365  kelac1  26309
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-13 1703  ax-14 1705  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297  ax-rep 4168  ax-sep 4178  ax-nul 4186  ax-pow 4225  ax-pr 4251  ax-un 4549
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-eu 2180  df-mo 2181  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ne 2481  df-ral 2582  df-rex 2583  df-reu 2584  df-rab 2586  df-v 2824  df-sbc 3026  df-csb 3116  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-pss 3202  df-nul 3490  df-if 3600  df-pw 3661  df-sn 3680  df-pr 3681  df-tp 3682  df-op 3683  df-uni 3865  df-int 3900  df-iun 3944  df-iin 3945  df-br 4061  df-opab 4115  df-mpt 4116  df-tr 4151  df-eprel 4342  df-id 4346  df-po 4351  df-so 4352  df-fr 4389  df-we 4391  df-ord 4432  df-on 4433  df-lim 4434  df-suc 4435  df-om 4694  df-xp 4732  df-rel 4733  df-cnv 4734  df-co 4735  df-dm 4736  df-rn 4737  df-res 4738  df-ima 4739  df-iota 5256  df-fun 5294  df-fn 5295  df-f 5296  df-f1 5297  df-fo 5298  df-f1o 5299  df-fv 5300  df-ov 5903  df-oprab 5904  df-mpt2 5905  df-recs 6430  df-rdg 6465  df-1o 6521  df-oadd 6525  df-er 6702  df-ixp 6861  df-en 6907  df-fin 6910  df-fi 7210  df-topgen 13393  df-pt 13394  df-top 16692  df-bases 16694  df-cld 16812
  Copyright terms: Public domain W3C validator