ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fprodcnv Unicode version

Theorem fprodcnv 12311
Description: Transform a product region using the converse operation. (Contributed by Scott Fenton, 1-Feb-2018.)
Hypotheses
Ref Expression
fprodcnv.1  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
fprodcnv.2  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
fprodcnv.3  |-  ( ph  ->  A  e.  Fin )
fprodcnv.4  |-  ( ph  ->  Rel  A )
fprodcnv.5  |-  ( (
ph  /\  x  e.  A )  ->  B  e.  CC )
Assertion
Ref Expression
fprodcnv  |-  ( ph  ->  prod_ x  e.  A  B  =  prod_ y  e.  `'  A C )
Distinct variable groups:    x, A, y    B, j, k, y    C, j, k    x, D, y   
j, k, x, y    ph, x, y
Allowed substitution hints:    ph( j, k)    A( j, k)    B( x)    C( x, y)    D( j, k)

Proof of Theorem fprodcnv
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 csbeq1a 3147 . . . 4  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
2 2ndexg 6362 . . . . . 6  |-  ( y  e.  _V  ->  ( 2nd `  y )  e. 
_V )
32elv 2817 . . . . 5  |-  ( 2nd `  y )  e.  _V
4 1stexg 6361 . . . . . 6  |-  ( y  e.  _V  ->  ( 1st `  y )  e. 
_V )
54elv 2817 . . . . 5  |-  ( 1st `  y )  e.  _V
6 vex 2816 . . . . . . . 8  |-  j  e. 
_V
7 vex 2816 . . . . . . . 8  |-  k  e. 
_V
86, 7opex 4345 . . . . . . 7  |-  <. j ,  k >.  e.  _V
9 fprodcnv.1 . . . . . . 7  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
108, 9csbie 3184 . . . . . 6  |-  [_ <. j ,  k >.  /  x ]_ B  =  D
11 opeq12 3885 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. j ,  k >.  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
1211csbeq1d 3145 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. j ,  k >.  /  x ]_ B  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B )
1310, 12eqtr3id 2279 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
143, 5, 13csbie2 3188 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B
151, 14eqtr4di 2283 . . 3  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ ( 2nd `  y
)  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
16 fprodcnv.4 . . . 4  |-  ( ph  ->  Rel  A )
17 fprodcnv.3 . . . 4  |-  ( ph  ->  A  e.  Fin )
18 relcnvfi 7208 . . . 4  |-  ( ( Rel  A  /\  A  e.  Fin )  ->  `' A  e.  Fin )
1916, 17, 18syl2anc 411 . . 3  |-  ( ph  ->  `' A  e.  Fin )
20 relcnv 5140 . . . . 5  |-  Rel  `' A
21 cnvf1o 6421 . . . . 5  |-  ( Rel  `' A  ->  ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A )
2220, 21ax-mp 5 . . . 4  |-  ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A
23 dfrel2 5213 . . . . . 6  |-  ( Rel 
A  <->  `' `' A  =  A
)
2416, 23sylib 122 . . . . 5  |-  ( ph  ->  `' `' A  =  A
)
2524f1oeq3d 5611 . . . 4  |-  ( ph  ->  ( ( z  e.  `' A  |->  U. `' { z } ) : `' A -1-1-onto-> `' `' A 
<->  ( z  e.  `' A  |->  U. `' { z } ) : `' A
-1-1-onto-> A ) )
2622, 25mpbii 148 . . 3  |-  ( ph  ->  ( z  e.  `' A  |->  U. `' { z } ) : `' A
-1-1-onto-> A )
27 1st2nd 6375 . . . . . . 7  |-  ( ( Rel  `' A  /\  y  e.  `' A
)  ->  y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
2820, 27mpan 424 . . . . . 6  |-  ( y  e.  `' A  -> 
y  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
2928fveq2d 5674 . . . . 5  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 y )  =  ( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
)
3028eleq1d 2301 . . . . . . 7  |-  ( y  e.  `' A  -> 
( y  e.  `' A 
<-> 
<. ( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A ) )
3130ibi 176 . . . . . 6  |-  ( y  e.  `' A  ->  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A )
32 sneq 3700 . . . . . . . . . 10  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  { z }  =  { <. ( 1st `  y ) ,  ( 2nd `  y
) >. } )
3332cnveqd 4931 . . . . . . . . 9  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  `' { z }  =  `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
3433unieqd 3925 . . . . . . . 8  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
35 opswapg 5249 . . . . . . . . 9  |-  ( ( ( 1st `  y
)  e.  _V  /\  ( 2nd `  y )  e.  _V )  ->  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
365, 3, 35mp2an 426 . . . . . . . 8  |-  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.
3734, 36eqtrdi 2281 . . . . . . 7  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
38 eqid 2232 . . . . . . 7  |-  ( z  e.  `' A  |->  U. `' { z } )  =  ( z  e.  `' A  |->  U. `' { z } )
393, 5opex 4345 . . . . . . 7  |-  <. ( 2nd `  y ) ,  ( 1st `  y
) >.  e.  _V
4037, 38, 39fvmpt 5754 . . . . . 6  |-  ( <.
( 1st `  y
) ,  ( 2nd `  y ) >.  e.  `' A  ->  ( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4131, 40syl 14 . . . . 5  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4229, 41eqtrd 2265 . . . 4  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 y )  = 
<. ( 2nd `  y
) ,  ( 1st `  y ) >. )
4342adantl 277 . . 3  |-  ( (
ph  /\  y  e.  `' A )  ->  (
( z  e.  `' A  |->  U. `' { z } ) `  y
)  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
44 fprodcnv.5 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  B  e.  CC )
4515, 19, 26, 43, 44fprodf1o 12274 . 2  |-  ( ph  ->  prod_ x  e.  A  B  =  prod_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
46 csbeq1a 3147 . . . . 5  |-  ( y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  C  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
4728, 46syl 14 . . . 4  |-  ( y  e.  `' A  ->  C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
487, 6opex 4345 . . . . . . 7  |-  <. k ,  j >.  e.  _V
49 fprodcnv.2 . . . . . . 7  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
5048, 49csbie 3184 . . . . . 6  |-  [_ <. k ,  j >.  /  y ]_ C  =  D
51 opeq12 3885 . . . . . . . 8  |-  ( ( k  =  ( 1st `  y )  /\  j  =  ( 2nd `  y
) )  ->  <. k ,  j >.  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
5251ancoms 268 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. k ,  j >.  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
5352csbeq1d 3145 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. k ,  j >.  /  y ]_ C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
5450, 53eqtr3id 2279 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
553, 5, 54csbie2 3188 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C
5647, 55eqtr4di 2283 . . 3  |-  ( y  e.  `' A  ->  C  =  [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
5756prodeq2i 12248 . 2  |-  prod_ y  e.  `'  A C  =  prod_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y )  / 
k ]_ D
5845, 57eqtr4di 2283 1  |-  ( ph  ->  prod_ x  e.  A  B  =  prod_ y  e.  `'  A C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   _Vcvv 2813   [_csb 3138   {csn 3689   <.cop 3692   U.cuni 3914    |-> cmpt 4171   `'ccnv 4748   Rel wrel 4754   -1-1-onto->wf1o 5351   ` cfv 5352   1stc1st 6332   2ndc2nd 6333   Fincfn 6975   CCcc 8125   prod_cprod 12236
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245  ax-arch 8246  ax-caucvg 8247
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-isom 5361  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-frec 6622  df-1o 6647  df-oadd 6651  df-er 6767  df-en 6976  df-dom 6977  df-fin 6978  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-n0 9497  df-z 9578  df-uz 9854  df-q 9952  df-rp 9987  df-fz 10343  df-fzo 10477  df-seqfrec 10810  df-exp 10901  df-ihash 11139  df-cj 11527  df-re 11528  df-im 11529  df-rsqrt 11683  df-abs 11684  df-clim 11964  df-proddc 12237
This theorem is referenced by:  fprodcom2fi  12312
  Copyright terms: Public domain W3C validator