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

Theorem shftfibg 9708
Description: Value of a fiber of the relation  F. (Contributed by Jim Kingdon, 15-Aug-2021.)
Assertion
Ref Expression
shftfibg  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( F  shift  A )
" { B }
)  =  ( F
" { ( B  -  A ) } ) )

Proof of Theorem shftfibg
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp2 939 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2 simp1 938 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  F  e.  V )
3 simp3 940 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  B  e.  CC )
4 shftfvalg 9706 . . . . . . 7  |-  ( ( A  e.  CC  /\  F  e.  V )  ->  ( F  shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
54breqd 3796 . . . . . 6  |-  ( ( A  e.  CC  /\  F  e.  V )  ->  ( B ( F 
shift  A ) z  <->  B { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z ) )
6 vex 2604 . . . . . . 7  |-  z  e. 
_V
7 eleq1 2141 . . . . . . . . 9  |-  ( x  =  B  ->  (
x  e.  CC  <->  B  e.  CC ) )
8 oveq1 5539 . . . . . . . . . 10  |-  ( x  =  B  ->  (
x  -  A )  =  ( B  -  A ) )
98breq1d 3795 . . . . . . . . 9  |-  ( x  =  B  ->  (
( x  -  A
) F y  <->  ( B  -  A ) F y ) )
107, 9anbi12d 456 . . . . . . . 8  |-  ( x  =  B  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F y ) ) )
11 breq2 3789 . . . . . . . . 9  |-  ( y  =  z  ->  (
( B  -  A
) F y  <->  ( B  -  A ) F z ) )
1211anbi2d 451 . . . . . . . 8  |-  ( y  =  z  ->  (
( B  e.  CC  /\  ( B  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
13 eqid 2081 . . . . . . . 8  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
1410, 12, 13brabg 4024 . . . . . . 7  |-  ( ( B  e.  CC  /\  z  e.  _V )  ->  ( B { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
156, 14mpan2 415 . . . . . 6  |-  ( B  e.  CC  ->  ( B { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
165, 15sylan9bb 449 . . . . 5  |-  ( ( ( A  e.  CC  /\  F  e.  V )  /\  B  e.  CC )  ->  ( B ( F  shift  A )
z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
171, 2, 3, 16syl21anc 1168 . . . 4  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
18173anibar 1106 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  -  A ) F z ) )
1918abbidv 2196 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  { z  |  B ( F 
shift  A ) z }  =  { z  |  ( B  -  A
) F z } )
20 imasng 4710 . . 3  |-  ( B  e.  CC  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
21203ad2ant3 961 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
223, 1subcld 7419 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B  -  A )  e.  CC )
23 imasng 4710 . . 3  |-  ( ( B  -  A )  e.  CC  ->  ( F " { ( B  -  A ) } )  =  { z  |  ( B  -  A ) F z } )
2422, 23syl 14 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( F " { ( B  -  A ) } )  =  { z  |  ( B  -  A ) F z } )
2519, 21, 243eqtr4d 2123 1  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( F  shift  A )
" { B }
)  =  ( F
" { ( B  -  A ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433   {cab 2067   _Vcvv 2601   {csn 3398   class class class wbr 3785   {copab 3838   "cima 4366  (class class class)co 5532   CCcc 6979    - cmin 7279    shift cshi 9702
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-resscn 7068  ax-1cn 7069  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-sub 7281  df-shft 9703
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator