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

Theorem fzonmapblen 10383
Description: The result of subtracting a nonnegative integer from a positive integer and adding another nonnegative integer which is less than the first one is less then the positive integer. (Contributed by Alexander van der Vekens, 19-May-2018.)
Assertion
Ref Expression
fzonmapblen  |-  ( ( A  e.  ( 0..^ N )  /\  B  e.  ( 0..^ N )  /\  B  <  A
)  ->  ( B  +  ( N  -  A ) )  < 
N )

Proof of Theorem fzonmapblen
StepHypRef Expression
1 elfzo0 10378 . . . 4  |-  ( A  e.  ( 0..^ N )  <->  ( A  e. 
NN0  /\  N  e.  NN  /\  A  <  N
) )
2 nn0re 9374 . . . . . 6  |-  ( A  e.  NN0  ->  A  e.  RR )
3 nnre 9113 . . . . . 6  |-  ( N  e.  NN  ->  N  e.  RR )
42, 3anim12i 338 . . . . 5  |-  ( ( A  e.  NN0  /\  N  e.  NN )  ->  ( A  e.  RR  /\  N  e.  RR ) )
543adant3 1041 . . . 4  |-  ( ( A  e.  NN0  /\  N  e.  NN  /\  A  <  N )  ->  ( A  e.  RR  /\  N  e.  RR ) )
61, 5sylbi 121 . . 3  |-  ( A  e.  ( 0..^ N )  ->  ( A  e.  RR  /\  N  e.  RR ) )
7 elfzoelz 10339 . . . 4  |-  ( B  e.  ( 0..^ N )  ->  B  e.  ZZ )
87zred 9565 . . 3  |-  ( B  e.  ( 0..^ N )  ->  B  e.  RR )
9 simpr 110 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  B  e.  RR )
10 simpll 527 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  A  e.  RR )
11 resubcl 8406 . . . . . . . . 9  |-  ( ( N  e.  RR  /\  A  e.  RR )  ->  ( N  -  A
)  e.  RR )
1211ancoms 268 . . . . . . . 8  |-  ( ( A  e.  RR  /\  N  e.  RR )  ->  ( N  -  A
)  e.  RR )
1312adantr 276 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  ( N  -  A )  e.  RR )
149, 10, 13ltadd1d 8681 . . . . . 6  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  ( B  < 
A  <->  ( B  +  ( N  -  A
) )  <  ( A  +  ( N  -  A ) ) ) )
1514biimpa 296 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  /\  B  <  A )  ->  ( B  +  ( N  -  A ) )  < 
( A  +  ( N  -  A ) ) )
16 recn 8128 . . . . . . . . 9  |-  ( A  e.  RR  ->  A  e.  CC )
17 recn 8128 . . . . . . . . 9  |-  ( N  e.  RR  ->  N  e.  CC )
1816, 17anim12i 338 . . . . . . . 8  |-  ( ( A  e.  RR  /\  N  e.  RR )  ->  ( A  e.  CC  /\  N  e.  CC ) )
1918adantr 276 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  ( A  e.  CC  /\  N  e.  CC ) )
2019adantr 276 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  /\  B  <  A )  ->  ( A  e.  CC  /\  N  e.  CC ) )
21 pncan3 8350 . . . . . 6  |-  ( ( A  e.  CC  /\  N  e.  CC )  ->  ( A  +  ( N  -  A ) )  =  N )
2220, 21syl 14 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  /\  B  <  A )  ->  ( A  +  ( N  -  A ) )  =  N )
2315, 22breqtrd 4108 . . . 4  |-  ( ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  /\  B  <  A )  ->  ( B  +  ( N  -  A ) )  < 
N )
2423ex 115 . . 3  |-  ( ( ( A  e.  RR  /\  N  e.  RR )  /\  B  e.  RR )  ->  ( B  < 
A  ->  ( B  +  ( N  -  A ) )  < 
N ) )
256, 8, 24syl2an 289 . 2  |-  ( ( A  e.  ( 0..^ N )  /\  B  e.  ( 0..^ N ) )  ->  ( B  <  A  ->  ( B  +  ( N  -  A ) )  < 
N ) )
26253impia 1224 1  |-  ( ( A  e.  ( 0..^ N )  /\  B  e.  ( 0..^ N )  /\  B  <  A
)  ->  ( B  +  ( N  -  A ) )  < 
N )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200   class class class wbr 4082  (class class class)co 6000   CCcc 7993   RRcr 7994   0cc0 7995    + caddc 7998    < clt 8177    - cmin 8313   NNcn 9106   NN0cn0 9365  ..^cfzo 10334
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-ltadd 8111
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-n0 9366  df-z 9443  df-uz 9719  df-fz 10201  df-fzo 10335
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator