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

Theorem shftfibg 11460
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 1025 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  A  e.  CC )
2 simp1 1024 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  F  e.  V )
3 simp3 1026 . . . . 5  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  B  e.  CC )
4 shftfvalg 11458 . . . . . . 7  |-  ( ( A  e.  CC  /\  F  e.  V )  ->  ( F  shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
54breqd 4104 . . . . . 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 2806 . . . . . . 7  |-  z  e. 
_V
7 eleq1 2294 . . . . . . . . 9  |-  ( x  =  B  ->  (
x  e.  CC  <->  B  e.  CC ) )
8 oveq1 6035 . . . . . . . . . 10  |-  ( x  =  B  ->  (
x  -  A )  =  ( B  -  A ) )
98breq1d 4103 . . . . . . . . 9  |-  ( x  =  B  ->  (
( x  -  A
) F y  <->  ( B  -  A ) F y ) )
107, 9anbi12d 473 . . . . . . . 8  |-  ( x  =  B  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F y ) ) )
11 breq2 4097 . . . . . . . . 9  |-  ( y  =  z  ->  (
( B  -  A
) F y  <->  ( B  -  A ) F z ) )
1211anbi2d 464 . . . . . . . 8  |-  ( y  =  z  ->  (
( B  e.  CC  /\  ( B  -  A
) F y )  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
13 eqid 2231 . . . . . . . 8  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
1410, 12, 13brabg 4369 . . . . . . 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 425 . . . . . 6  |-  ( B  e.  CC  ->  ( B { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } z  <-> 
( B  e.  CC  /\  ( B  -  A
) F z ) ) )
165, 15sylan9bb 462 . . . . 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 1273 . . . 4  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  e.  CC  /\  ( B  -  A ) F z ) ) )
18173anibar 1192 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B ( F  shift  A ) z  <->  ( B  -  A ) F z ) )
1918abbidv 2350 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  { z  |  B ( F 
shift  A ) z }  =  { z  |  ( B  -  A
) F z } )
20 imasng 5108 . . 3  |-  ( B  e.  CC  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
21203ad2ant3 1047 . 2  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( F  shift  A )
" { B }
)  =  { z  |  B ( F 
shift  A ) z } )
223, 1subcld 8549 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC  /\  B  e.  CC )  ->  ( B  -  A )  e.  CC )
23 imasng 5108 . . 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 2274 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 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2202   {cab 2217   _Vcvv 2803   {csn 3673   class class class wbr 4093   {copab 4154   "cima 4734  (class class class)co 6028   CCcc 8090    - cmin 8409    shift cshi 11454
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-resscn 8184  ax-1cn 8185  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-sub 8411  df-shft 11455
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator