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

Theorem ovshftex 11584
Description: Existence of the result of applying shift. (Contributed by Jim Kingdon, 15-Aug-2021.)
Assertion
Ref Expression
ovshftex  |-  ( ( F  e.  V  /\  A  e.  CC )  ->  ( F  shift  A )  e.  _V )

Proof of Theorem ovshftex
Dummy variables  u  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 shftfvalg 11583 . . 3  |-  ( ( A  e.  CC  /\  F  e.  V )  ->  ( F  shift  A )  =  { <. z ,  w >.  |  (
z  e.  CC  /\  ( z  -  A
) F w ) } )
21ancoms 268 . 2  |-  ( ( F  e.  V  /\  A  e.  CC )  ->  ( F  shift  A )  =  { <. z ,  w >.  |  (
z  e.  CC  /\  ( z  -  A
) F w ) } )
3 cnex 8303 . . . 4  |-  CC  e.  _V
43a1i 9 . . 3  |-  ( ( F  e.  V  /\  A  e.  CC )  ->  CC  e.  _V )
5 rnexg 5047 . . . . 5  |-  ( F  e.  V  ->  ran  F  e.  _V )
65ad2antrr 492 . . . 4  |-  ( ( ( F  e.  V  /\  A  e.  CC )  /\  z  e.  CC )  ->  ran  F  e.  _V )
7 vex 2824 . . . . . . . 8  |-  u  e. 
_V
8 breq2 4134 . . . . . . . 8  |-  ( w  =  u  ->  (
( z  -  A
) F w  <->  ( z  -  A ) F u ) )
97, 8elab 2970 . . . . . . 7  |-  ( u  e.  { w  |  ( z  -  A
) F w }  <->  ( z  -  A ) F u )
10 simpr 110 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  z  e.  CC )
11 simpl 109 . . . . . . . . . 10  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  A  e.  CC )
1210, 11subcld 8637 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  ( z  -  A
)  e.  CC )
13 brelrng 5013 . . . . . . . . . 10  |-  ( ( ( z  -  A
)  e.  CC  /\  u  e.  _V  /\  (
z  -  A ) F u )  ->  u  e.  ran  F )
147, 13mp3an2 1366 . . . . . . . . 9  |-  ( ( ( z  -  A
)  e.  CC  /\  ( z  -  A
) F u )  ->  u  e.  ran  F )
1512, 14sylan 283 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  z  e.  CC )  /\  ( z  -  A ) F u )  ->  u  e.  ran  F )
1615ex 115 . . . . . . 7  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  ( ( z  -  A ) F u  ->  u  e.  ran  F ) )
179, 16biimtrid 152 . . . . . 6  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  ( u  e.  {
w  |  ( z  -  A ) F w }  ->  u  e.  ran  F ) )
1817ssrdv 3254 . . . . 5  |-  ( ( A  e.  CC  /\  z  e.  CC )  ->  { w  |  ( z  -  A ) F w }  C_  ran  F )
1918adantll 480 . . . 4  |-  ( ( ( F  e.  V  /\  A  e.  CC )  /\  z  e.  CC )  ->  { w  |  ( z  -  A
) F w }  C_ 
ran  F )
206, 19ssexd 4273 . . 3  |-  ( ( ( F  e.  V  /\  A  e.  CC )  /\  z  e.  CC )  ->  { w  |  ( z  -  A
) F w }  e.  _V )
214, 20opabex3d 6350 . 2  |-  ( ( F  e.  V  /\  A  e.  CC )  ->  { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A ) F w ) }  e.  _V )
222, 21eqeltrd 2315 1  |-  ( ( F  e.  V  /\  A  e.  CC )  ->  ( F  shift  A )  e.  _V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   {cab 2224   _Vcvv 2821    C_ wss 3220   class class class wbr 4130   {copab 4191   ran crn 4775  (class class class)co 6085   CCcc 8177    - cmin 8497    shift cshi 11579
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-shft 11580
This theorem is used by:  2shfti  11596  climshftlemg  12068  climshft  12070  climshft2  12072  eftlub  12457
  Copyright terms: Public domain W3C validator