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

Theorem shftfib 11383
Description: Value of a fiber of the relation  F. (Contributed by Mario Carneiro, 4-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
shftfib  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A ) " { B } )  =  ( F " { ( B  -  A ) } ) )

Proof of Theorem shftfib
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 shftfval.1 . . . . . . 7  |-  F  e. 
_V
21shftfval 11381 . . . . . 6  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
32breqd 4099 . . . . 5  |-  ( A  e.  CC  ->  ( B ( F  shift  A ) z  <->  B { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z ) )
4 vex 2805 . . . . . 6  |-  z  e. 
_V
5 eleq1 2294 . . . . . . . 8  |-  ( x  =  B  ->  (
x  e.  CC  <->  B  e.  CC ) )
6 oveq1 6024 . . . . . . . . 9  |-  ( x  =  B  ->  (
x  -  A )  =  ( B  -  A ) )
76breq1d 4098 . . . . . . . 8  |-  ( x  =  B  ->  (
( x  -  A
) F y  <->  ( B  -  A ) F y ) )
85, 7anbi12d 473 . . . . . . 7  |-  ( x  =  B  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F y ) ) )
9 breq2 4092 . . . . . . . 8  |-  ( y  =  z  ->  (
( B  -  A
) F y  <->  ( B  -  A ) F z ) )
109anbi2d 464 . . . . . . 7  |-  ( y  =  z  ->  (
( B  e.  CC  /\  ( B  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
11 eqid 2231 . . . . . . 7  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
128, 10, 11brabg 4363 . . . . . 6  |-  ( ( B  e.  CC  /\  z  e.  _V )  ->  ( B { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
134, 12mpan2 425 . . . . 5  |-  ( B  e.  CC  ->  ( B { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
143, 13sylan9bb 462 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B ( F 
shift  A ) z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
15 ibar 301 . . . . 5  |-  ( B  e.  CC  ->  (
( B  -  A
) F z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
1615adantl 277 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( B  -  A ) F z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
1714, 16bitr4d 191 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B ( F 
shift  A ) z  <->  ( B  -  A ) F z ) )
1817abbidv 2349 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  { z  |  B
( F  shift  A ) z }  =  {
z  |  ( B  -  A ) F z } )
19 imasng 5101 . . 3  |-  ( B  e.  CC  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
2019adantl 277 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A ) " { B } )  =  {
z  |  B ( F  shift  A )
z } )
21 simpr 110 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  B  e.  CC )
22 simpl 109 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2321, 22subcld 8489 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B  -  A
)  e.  CC )
24 imasng 5101 . . 3  |-  ( ( B  -  A )  e.  CC  ->  ( F " { ( B  -  A ) } )  =  { z  |  ( B  -  A ) F z } )
2523, 24syl 14 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( F " {
( B  -  A
) } )  =  { z  |  ( B  -  A ) F z } )
2618, 20, 253eqtr4d 2274 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A ) " { B } )  =  ( F " { ( B  -  A ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   {cab 2217   _Vcvv 2802   {csn 3669   class class class wbr 4088   {copab 4149   "cima 4728  (class class class)co 6017   CCcc 8029    - cmin 8349    shift cshi 11374
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-resscn 8123  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-sub 8351  df-shft 11375
This theorem is referenced by:  shftval  11385
  Copyright terms: Public domain W3C validator