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

Theorem imainrect 5043
Description: Image of a relation restricted to a rectangular region. (Contributed by Stefan O'Rear, 19-Feb-2015.)
Assertion
Ref Expression
imainrect  |-  ( ( G  i^i  ( A  X.  B ) )
" Y )  =  ( ( G "
( Y  i^i  A
) )  i^i  B
)

Proof of Theorem imainrect
StepHypRef Expression
1 df-res 4610 . . 3  |-  ( ( G  i^i  ( A  X.  B ) )  |`  Y )  =  ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )
21rneqi 4826 . 2  |-  ran  (
( G  i^i  ( A  X.  B ) )  |`  Y )  =  ran  ( ( G  i^i  ( A  X.  B
) )  i^i  ( Y  X.  _V ) )
3 df-ima 4611 . 2  |-  ( ( G  i^i  ( A  X.  B ) )
" Y )  =  ran  ( ( G  i^i  ( A  X.  B ) )  |`  Y )
4 df-ima 4611 . . . . 5  |-  ( G
" ( Y  i^i  A ) )  =  ran  ( G  |`  ( Y  i^i  A ) )
5 df-res 4610 . . . . . 6  |-  ( G  |`  ( Y  i^i  A
) )  =  ( G  i^i  ( ( Y  i^i  A )  X.  _V ) )
65rneqi 4826 . . . . 5  |-  ran  ( G  |`  ( Y  i^i  A ) )  =  ran  ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)
74, 6eqtri 2185 . . . 4  |-  ( G
" ( Y  i^i  A ) )  =  ran  ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)
87ineq1i 3314 . . 3  |-  ( ( G " ( Y  i^i  A ) )  i^i  B )  =  ( ran  ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  i^i 
B )
9 cnvin 5005 . . . . . 6  |-  `' ( ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  ( _V  X.  B ) )  =  ( `' ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  i^i  `' ( _V  X.  B ) )
10 inxp 4732 . . . . . . . . . 10  |-  ( ( A  X.  _V )  i^i  ( _V  X.  B
) )  =  ( ( A  i^i  _V )  X.  ( _V  i^i  B ) )
11 inv1 3440 . . . . . . . . . . 11  |-  ( A  i^i  _V )  =  A
12 incom 3309 . . . . . . . . . . . 12  |-  ( _V 
i^i  B )  =  ( B  i^i  _V )
13 inv1 3440 . . . . . . . . . . . 12  |-  ( B  i^i  _V )  =  B
1412, 13eqtri 2185 . . . . . . . . . . 11  |-  ( _V 
i^i  B )  =  B
1511, 14xpeq12i 4620 . . . . . . . . . 10  |-  ( ( A  i^i  _V )  X.  ( _V  i^i  B
) )  =  ( A  X.  B )
1610, 15eqtr2i 2186 . . . . . . . . 9  |-  ( A  X.  B )  =  ( ( A  X.  _V )  i^i  ( _V  X.  B ) )
1716ineq2i 3315 . . . . . . . 8  |-  ( ( G  i^i  ( Y  X.  _V ) )  i^i  ( A  X.  B ) )  =  ( ( G  i^i  ( Y  X.  _V )
)  i^i  ( ( A  X.  _V )  i^i  ( _V  X.  B
) ) )
18 in32 3329 . . . . . . . 8  |-  ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )  =  ( ( G  i^i  ( Y  X.  _V ) )  i^i  ( A  X.  B ) )
19 xpindir 4734 . . . . . . . . . . . 12  |-  ( ( Y  i^i  A )  X.  _V )  =  ( ( Y  X.  _V )  i^i  ( A  X.  _V ) )
2019ineq2i 3315 . . . . . . . . . . 11  |-  ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  =  ( G  i^i  (
( Y  X.  _V )  i^i  ( A  X.  _V ) ) )
21 inass 3327 . . . . . . . . . . 11  |-  ( ( G  i^i  ( Y  X.  _V ) )  i^i  ( A  X.  _V ) )  =  ( G  i^i  ( ( Y  X.  _V )  i^i  ( A  X.  _V ) ) )
2220, 21eqtr4i 2188 . . . . . . . . . 10  |-  ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  =  ( ( G  i^i  ( Y  X.  _V )
)  i^i  ( A  X.  _V ) )
2322ineq1i 3314 . . . . . . . . 9  |-  ( ( G  i^i  ( ( Y  i^i  A )  X.  _V ) )  i^i  ( _V  X.  B ) )  =  ( ( ( G  i^i  ( Y  X.  _V ) )  i^i  ( A  X.  _V ) )  i^i  ( _V  X.  B ) )
24 inass 3327 . . . . . . . . 9  |-  ( ( ( G  i^i  ( Y  X.  _V ) )  i^i  ( A  X.  _V ) )  i^i  ( _V  X.  B ) )  =  ( ( G  i^i  ( Y  X.  _V ) )  i^i  (
( A  X.  _V )  i^i  ( _V  X.  B ) ) )
2523, 24eqtri 2185 . . . . . . . 8  |-  ( ( G  i^i  ( ( Y  i^i  A )  X.  _V ) )  i^i  ( _V  X.  B ) )  =  ( ( G  i^i  ( Y  X.  _V )
)  i^i  ( ( A  X.  _V )  i^i  ( _V  X.  B
) ) )
2617, 18, 253eqtr4i 2195 . . . . . . 7  |-  ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )  =  ( ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  ( _V  X.  B ) )
2726cnveqi 4773 . . . . . 6  |-  `' ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )  =  `' ( ( G  i^i  ( ( Y  i^i  A )  X.  _V )
)  i^i  ( _V  X.  B ) )
28 df-res 4610 . . . . . . 7  |-  ( `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  |`  B )  =  ( `' ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  i^i  ( B  X.  _V ) )
29 cnvxp 5016 . . . . . . . 8  |-  `' ( _V  X.  B )  =  ( B  X.  _V )
3029ineq2i 3315 . . . . . . 7  |-  ( `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  `' ( _V  X.  B ) )  =  ( `' ( G  i^i  ( ( Y  i^i  A )  X.  _V ) )  i^i  ( B  X.  _V ) )
3128, 30eqtr4i 2188 . . . . . 6  |-  ( `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  |`  B )  =  ( `' ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  i^i  `' ( _V  X.  B ) )
329, 27, 313eqtr4ri 2196 . . . . 5  |-  ( `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  |`  B )  =  `' ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )
3332dmeqi 4799 . . . 4  |-  dom  ( `' ( G  i^i  ( ( Y  i^i  A )  X.  _V )
)  |`  B )  =  dom  `' ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )
34 incom 3309 . . . . 5  |-  ( B  i^i  dom  `' ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) ) )  =  ( dom  `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  B )
35 dmres 4899 . . . . 5  |-  dom  ( `' ( G  i^i  ( ( Y  i^i  A )  X.  _V )
)  |`  B )  =  ( B  i^i  dom  `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
) )
36 df-rn 4609 . . . . . 6  |-  ran  ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )  =  dom  `' ( G  i^i  ( ( Y  i^i  A )  X. 
_V ) )
3736ineq1i 3314 . . . . 5  |-  ( ran  ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  B )  =  ( dom  `' ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  B )
3834, 35, 373eqtr4ri 2196 . . . 4  |-  ( ran  ( G  i^i  (
( Y  i^i  A
)  X.  _V )
)  i^i  B )  =  dom  ( `' ( G  i^i  ( ( Y  i^i  A )  X.  _V ) )  |`  B )
39 df-rn 4609 . . . 4  |-  ran  (
( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )  =  dom  `' ( ( G  i^i  ( A  X.  B
) )  i^i  ( Y  X.  _V ) )
4033, 38, 393eqtr4ri 2196 . . 3  |-  ran  (
( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )  =  ( ran  ( G  i^i  ( ( Y  i^i  A )  X.  _V )
)  i^i  B )
418, 40eqtr4i 2188 . 2  |-  ( ( G " ( Y  i^i  A ) )  i^i  B )  =  ran  ( ( G  i^i  ( A  X.  B ) )  i^i  ( Y  X.  _V ) )
422, 3, 413eqtr4i 2195 1  |-  ( ( G  i^i  ( A  X.  B ) )
" Y )  =  ( ( G "
( Y  i^i  A
) )  i^i  B
)
Colors of variables: wff set class
Syntax hints:    = wceq 1342   _Vcvv 2721    i^i cin 3110    X. cxp 4596   `'ccnv 4597   dom cdm 4598   ran crn 4599    |` cres 4600   "cima 4601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-br 3977  df-opab 4038  df-xp 4604  df-rel 4605  df-cnv 4606  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611
This theorem is referenced by:  ecinxp  6567
  Copyright terms: Public domain W3C validator