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

Theorem fprodcnv 11646
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 3078 . . . 4  |-  ( x  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >.  ->  B  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
2 2ndexg 6182 . . . . . 6  |-  ( y  e.  _V  ->  ( 2nd `  y )  e. 
_V )
32elv 2753 . . . . 5  |-  ( 2nd `  y )  e.  _V
4 1stexg 6181 . . . . . 6  |-  ( y  e.  _V  ->  ( 1st `  y )  e. 
_V )
54elv 2753 . . . . 5  |-  ( 1st `  y )  e.  _V
6 vex 2752 . . . . . . . 8  |-  j  e. 
_V
7 vex 2752 . . . . . . . 8  |-  k  e. 
_V
86, 7opex 4241 . . . . . . 7  |-  <. j ,  k >.  e.  _V
9 fprodcnv.1 . . . . . . 7  |-  ( x  =  <. j ,  k
>.  ->  B  =  D )
108, 9csbie 3114 . . . . . 6  |-  [_ <. j ,  k >.  /  x ]_ B  =  D
11 opeq12 3792 . . . . . . 7  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  <. j ,  k >.  =  <. ( 2nd `  y ) ,  ( 1st `  y
) >. )
1211csbeq1d 3076 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. j ,  k >.  /  x ]_ B  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B )
1310, 12eqtr3id 2234 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 2nd `  y
) ,  ( 1st `  y ) >.  /  x ]_ B )
143, 5, 13csbie2 3118 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 2nd `  y ) ,  ( 1st `  y
) >.  /  x ]_ B
151, 14eqtr4di 2238 . . 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 6953 . . . 4  |-  ( ( Rel  A  /\  A  e.  Fin )  ->  `' A  e.  Fin )
1916, 17, 18syl2anc 411 . . 3  |-  ( ph  ->  `' A  e.  Fin )
20 relcnv 5018 . . . . 5  |-  Rel  `' A
21 cnvf1o 6239 . . . . 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 5091 . . . . . 6  |-  ( Rel 
A  <->  `' `' A  =  A
)
2416, 23sylib 122 . . . . 5  |-  ( ph  ->  `' `' A  =  A
)
2524f1oeq3d 5470 . . . 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 6195 . . . . . . 7  |-  ( ( Rel  `' A  /\  y  e.  `' A
)  ->  y  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
2820, 27mpan 424 . . . . . 6  |-  ( y  e.  `' A  -> 
y  =  <. ( 1st `  y ) ,  ( 2nd `  y
) >. )
2928fveq2d 5531 . . . . 5  |-  ( y  e.  `' A  -> 
( ( z  e.  `' A  |->  U. `' { z } ) `
 y )  =  ( ( z  e.  `' A  |->  U. `' { z } ) `
 <. ( 1st `  y
) ,  ( 2nd `  y ) >. )
)
3028eleq1d 2256 . . . . . . 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 3615 . . . . . . . . . 10  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  { z }  =  { <. ( 1st `  y ) ,  ( 2nd `  y
) >. } )
3332cnveqd 4815 . . . . . . . . 9  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  `' { z }  =  `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
3433unieqd 3832 . . . . . . . 8  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  U. `' { <. ( 1st `  y
) ,  ( 2nd `  y ) >. } )
35 opswapg 5127 . . . . . . . . 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 2236 . . . . . . 7  |-  ( z  =  <. ( 1st `  y
) ,  ( 2nd `  y ) >.  ->  U. `' { z }  =  <. ( 2nd `  y
) ,  ( 1st `  y ) >. )
38 eqid 2187 . . . . . . 7  |-  ( z  e.  `' A  |->  U. `' { z } )  =  ( z  e.  `' A  |->  U. `' { z } )
393, 5opex 4241 . . . . . . 7  |-  <. ( 2nd `  y ) ,  ( 1st `  y
) >.  e.  _V
4037, 38, 39fvmpt 5606 . . . . . 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 2220 . . . 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 11609 . 2  |-  ( ph  ->  prod_ x  e.  A  B  =  prod_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
46 csbeq1a 3078 . . . . 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 4241 . . . . . . 7  |-  <. k ,  j >.  e.  _V
49 fprodcnv.2 . . . . . . 7  |-  ( y  =  <. k ,  j
>.  ->  C  =  D )
5048, 49csbie 3114 . . . . . 6  |-  [_ <. k ,  j >.  /  y ]_ C  =  D
51 opeq12 3792 . . . . . . . 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 3076 . . . . . 6  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  [_ <. k ,  j >.  /  y ]_ C  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C )
5450, 53eqtr3id 2234 . . . . 5  |-  ( ( j  =  ( 2nd `  y )  /\  k  =  ( 1st `  y
) )  ->  D  =  [_ <. ( 1st `  y
) ,  ( 2nd `  y ) >.  /  y ]_ C )
553, 5, 54csbie2 3118 . . . 4  |-  [_ ( 2nd `  y )  / 
j ]_ [_ ( 1st `  y )  /  k ]_ D  =  [_ <. ( 1st `  y ) ,  ( 2nd `  y
) >.  /  y ]_ C
5647, 55eqtr4di 2238 . . 3  |-  ( y  e.  `' A  ->  C  =  [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y
)  /  k ]_ D )
5756prodeq2i 11583 . 2  |-  prod_ y  e.  `'  A C  =  prod_ y  e.  `'  A [_ ( 2nd `  y )  /  j ]_ [_ ( 1st `  y )  / 
k ]_ D
5845, 57eqtr4di 2238 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 1363    e. wcel 2158   _Vcvv 2749   [_csb 3069   {csn 3604   <.cop 3607   U.cuni 3821    |-> cmpt 4076   `'ccnv 4637   Rel wrel 4643   -1-1-onto->wf1o 5227   ` cfv 5228   1stc1st 6152   2ndc2nd 6153   Fincfn 6753   CCcc 7822   prod_cprod 11571
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599  ax-cnex 7915  ax-resscn 7916  ax-1cn 7917  ax-1re 7918  ax-icn 7919  ax-addcl 7920  ax-addrcl 7921  ax-mulcl 7922  ax-mulrcl 7923  ax-addcom 7924  ax-mulcom 7925  ax-addass 7926  ax-mulass 7927  ax-distr 7928  ax-i2m1 7929  ax-0lt1 7930  ax-1rid 7931  ax-0id 7932  ax-rnegex 7933  ax-precex 7934  ax-cnre 7935  ax-pre-ltirr 7936  ax-pre-ltwlin 7937  ax-pre-lttrn 7938  ax-pre-apti 7939  ax-pre-ltadd 7940  ax-pre-mulgt0 7941  ax-pre-mulext 7942  ax-arch 7943  ax-caucvg 7944
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-if 3547  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-po 4308  df-iso 4309  df-iord 4378  df-on 4380  df-ilim 4381  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-isom 5237  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6154  df-2nd 6155  df-recs 6319  df-irdg 6384  df-frec 6405  df-1o 6430  df-oadd 6434  df-er 6548  df-en 6754  df-dom 6755  df-fin 6756  df-pnf 8007  df-mnf 8008  df-xr 8009  df-ltxr 8010  df-le 8011  df-sub 8143  df-neg 8144  df-reap 8545  df-ap 8552  df-div 8643  df-inn 8933  df-2 8991  df-3 8992  df-4 8993  df-n0 9190  df-z 9267  df-uz 9542  df-q 9633  df-rp 9667  df-fz 10022  df-fzo 10156  df-seqfrec 10459  df-exp 10533  df-ihash 10769  df-cj 10864  df-re 10865  df-im 10866  df-rsqrt 11020  df-abs 11021  df-clim 11300  df-proddc 11572
This theorem is referenced by:  fprodcom2fi  11647
  Copyright terms: Public domain W3C validator