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

Theorem shftfibg 10784
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 993 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2 simp1 992 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  F  e.  V )
3 simp3 994 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  B  e.  CC )
4 shftfvalg 10782 . . . . . . 7  |-  ( ( A  e.  CC  /\  F  e.  V )  ->  ( F  shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
54breqd 4000 . . . . . 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 2733 . . . . . . 7  |-  z  e. 
_V
7 eleq1 2233 . . . . . . . . 9  |-  ( x  =  B  ->  (
x  e.  CC  <->  B  e.  CC ) )
8 oveq1 5860 . . . . . . . . . 10  |-  ( x  =  B  ->  (
x  -  A )  =  ( B  -  A ) )
98breq1d 3999 . . . . . . . . 9  |-  ( x  =  B  ->  (
( x  -  A
) F y  <->  ( B  -  A ) F y ) )
107, 9anbi12d 470 . . . . . . . 8  |-  ( x  =  B  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F y ) ) )
11 breq2 3993 . . . . . . . . 9  |-  ( y  =  z  ->  (
( B  -  A
) F y  <->  ( B  -  A ) F z ) )
1211anbi2d 461 . . . . . . . 8  |-  ( y  =  z  ->  (
( B  e.  CC  /\  ( B  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
13 eqid 2170 . . . . . . . 8  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
1410, 12, 13brabg 4254 . . . . . . 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 423 . . . . . 6  |-  ( B  e.  CC  ->  ( B { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
165, 15sylan9bb 459 . . . . 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 1232 . . . 4  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
18173anibar 1160 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  -  A ) F z ) )
1918abbidv 2288 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  { z  |  B ( F 
shift  A ) z }  =  { z  |  ( B  -  A
) F z } )
20 imasng 4976 . . 3  |-  ( B  e.  CC  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
21203ad2ant3 1015 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
223, 1subcld 8230 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B  -  A )  e.  CC )
23 imasng 4976 . . 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 2213 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 103    <-> wb 104    /\ w3a 973    = wceq 1348    e. wcel 2141   {cab 2156   _Vcvv 2730   {csn 3583   class class class wbr 3989   {copab 4049   "cima 4614  (class class class)co 5853   CCcc 7772    - cmin 8090    shift cshi 10778
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-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-resscn 7866  ax-1cn 7867  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-sub 8092  df-shft 10779
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator