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

Theorem shftfib 10482
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 10480 . . . . . 6  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
32breqd 3904 . . . . 5  |-  ( A  e.  CC  ->  ( B ( F  shift  A ) z  <->  B { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z ) )
4 vex 2658 . . . . . 6  |-  z  e. 
_V
5 eleq1 2175 . . . . . . . 8  |-  ( x  =  B  ->  (
x  e.  CC  <->  B  e.  CC ) )
6 oveq1 5733 . . . . . . . . 9  |-  ( x  =  B  ->  (
x  -  A )  =  ( B  -  A ) )
76breq1d 3903 . . . . . . . 8  |-  ( x  =  B  ->  (
( x  -  A
) F y  <->  ( B  -  A ) F y ) )
85, 7anbi12d 462 . . . . . . 7  |-  ( x  =  B  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F y ) ) )
9 breq2 3897 . . . . . . . 8  |-  ( y  =  z  ->  (
( B  -  A
) F y  <->  ( B  -  A ) F z ) )
109anbi2d 457 . . . . . . 7  |-  ( y  =  z  ->  (
( B  e.  CC  /\  ( B  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
11 eqid 2113 . . . . . . 7  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
128, 10, 11brabg 4149 . . . . . 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 419 . . . . 5  |-  ( B  e.  CC  ->  ( B { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
143, 13sylan9bb 455 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B ( F 
shift  A ) z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
15 ibar 297 . . . . 5  |-  ( B  e.  CC  ->  (
( B  -  A
) F z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
1615adantl 273 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( B  -  A ) F z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
1714, 16bitr4d 190 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B ( F 
shift  A ) z  <->  ( B  -  A ) F z ) )
1817abbidv 2230 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  { z  |  B
( F  shift  A ) z }  =  {
z  |  ( B  -  A ) F z } )
19 imasng 4860 . . 3  |-  ( B  e.  CC  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
2019adantl 273 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A ) " { B } )  =  {
z  |  B ( F  shift  A )
z } )
21 simpr 109 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  B  e.  CC )
22 simpl 108 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2321, 22subcld 7990 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B  -  A
)  e.  CC )
24 imasng 4860 . . 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 2155 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 103    <-> wb 104    = wceq 1312    e. wcel 1461   {cab 2099   _Vcvv 2655   {csn 3491   class class class wbr 3893   {copab 3946   "cima 4500  (class class class)co 5726   CCcc 7539    - cmin 7850    shift cshi 10473
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-13 1472  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-coll 4001  ax-sep 4004  ax-pow 4056  ax-pr 4089  ax-un 4313  ax-setind 4410  ax-resscn 7631  ax-1cn 7632  ax-icn 7634  ax-addcl 7635  ax-addrcl 7636  ax-mulcl 7637  ax-addcom 7639  ax-addass 7641  ax-distr 7643  ax-i2m1 7644  ax-0id 7647  ax-rnegex 7648  ax-cnre 7650
This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-fal 1318  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ne 2281  df-ral 2393  df-rex 2394  df-reu 2395  df-rab 2397  df-v 2657  df-sbc 2877  df-csb 2970  df-dif 3037  df-un 3039  df-in 3041  df-ss 3048  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-iun 3779  df-br 3894  df-opab 3948  df-mpt 3949  df-id 4173  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-ima 4510  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087  df-riota 5682  df-ov 5729  df-oprab 5730  df-mpo 5731  df-sub 7852  df-shft 10474
This theorem is referenced by:  shftval  10484
  Copyright terms: Public domain W3C validator