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

Theorem fzonmapblen 10530
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 10524 . . . 4  |-  ( A  e.  ( 0..^ N )  <->  ( A  e. 
NN0  /\  N  e.  NN  /\  A  <  N
) )
2 nn0re 9507 . . . . . 6  |-  ( A  e.  NN0  ->  A  e.  RR )
3 nnre 9246 . . . . . 6  |-  ( N  e.  NN  ->  N  e.  RR )
42, 3anim12i 338 . . . . 5  |-  ( ( A  e.  NN0  /\  N  e.  NN )  ->  ( A  e.  RR  /\  N  e.  RR ) )
543adant3 1044 . . . 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 10485 . . . 4  |-  ( B  e.  ( 0..^ N )  ->  B  e.  ZZ )
87zred 9703 . . 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 8539 . . . . . . . . 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 8814 . . . . . 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 8262 . . . . . . . . 9  |-  ( A  e.  RR  ->  A  e.  CC )
17 recn 8262 . . . . . . . . 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 8483 . . . . . 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 4137 . . . 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 1227 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 1005    = wceq 1398    e. wcel 2205   class class class wbr 4111  (class class class)co 6052   CCcc 8127   RRcr 8128   0cc0 8129    + caddc 8132    < clt 8310    - cmin 8446   NNcn 9239   NN0cn0 9498  ..^cfzo 10480
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-n0 9499  df-z 9580  df-uz 9857  df-fz 10346  df-fzo 10481
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator