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

Theorem mulsucdiv2z 12391
Description: An integer multiplied with its successor divided by 2 yields an integer, i.e. an integer multiplied with its successor is even. (Contributed by AV, 19-Jul-2021.)
Assertion
Ref Expression
mulsucdiv2z  |-  ( N  e.  ZZ  ->  (
( N  x.  ( N  +  1 ) )  /  2 )  e.  ZZ )

Proof of Theorem mulsucdiv2z
StepHypRef Expression
1 zeo 9548 . 2  |-  ( N  e.  ZZ  ->  (
( N  /  2
)  e.  ZZ  \/  ( ( N  + 
1 )  /  2
)  e.  ZZ ) )
2 peano2z 9478 . . . . . 6  |-  ( N  e.  ZZ  ->  ( N  +  1 )  e.  ZZ )
3 zmulcl 9496 . . . . . 6  |-  ( ( ( N  /  2
)  e.  ZZ  /\  ( N  +  1
)  e.  ZZ )  ->  ( ( N  /  2 )  x.  ( N  +  1 ) )  e.  ZZ )
42, 3sylan2 286 . . . . 5  |-  ( ( ( N  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( N  / 
2 )  x.  ( N  +  1 ) )  e.  ZZ )
5 zcn 9447 . . . . . . . 8  |-  ( N  e.  ZZ  ->  N  e.  CC )
62zcnd 9566 . . . . . . . 8  |-  ( N  e.  ZZ  ->  ( N  +  1 )  e.  CC )
7 2cnd 9179 . . . . . . . 8  |-  ( N  e.  ZZ  ->  2  e.  CC )
8 2ap0 9199 . . . . . . . . 9  |-  2 #  0
98a1i 9 . . . . . . . 8  |-  ( N  e.  ZZ  ->  2 #  0 )
105, 6, 7, 9div23apd 8971 . . . . . . 7  |-  ( N  e.  ZZ  ->  (
( N  x.  ( N  +  1 ) )  /  2 )  =  ( ( N  /  2 )  x.  ( N  +  1 ) ) )
1110eleq1d 2298 . . . . . 6  |-  ( N  e.  ZZ  ->  (
( ( N  x.  ( N  +  1
) )  /  2
)  e.  ZZ  <->  ( ( N  /  2 )  x.  ( N  +  1 ) )  e.  ZZ ) )
1211adantl 277 . . . . 5  |-  ( ( ( N  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( ( N  x.  ( N  + 
1 ) )  / 
2 )  e.  ZZ  <->  ( ( N  /  2
)  x.  ( N  +  1 ) )  e.  ZZ ) )
134, 12mpbird 167 . . . 4  |-  ( ( ( N  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( N  x.  ( N  +  1
) )  /  2
)  e.  ZZ )
1413ex 115 . . 3  |-  ( ( N  /  2 )  e.  ZZ  ->  ( N  e.  ZZ  ->  ( ( N  x.  ( N  +  1 ) )  /  2 )  e.  ZZ ) )
15 zmulcl 9496 . . . . . 6  |-  ( ( N  e.  ZZ  /\  ( ( N  + 
1 )  /  2
)  e.  ZZ )  ->  ( N  x.  ( ( N  + 
1 )  /  2
) )  e.  ZZ )
1615ancoms 268 . . . . 5  |-  ( ( ( ( N  + 
1 )  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  x.  (
( N  +  1 )  /  2 ) )  e.  ZZ )
175, 6, 7, 9divassapd 8969 . . . . . . 7  |-  ( N  e.  ZZ  ->  (
( N  x.  ( N  +  1 ) )  /  2 )  =  ( N  x.  ( ( N  + 
1 )  /  2
) ) )
1817eleq1d 2298 . . . . . 6  |-  ( N  e.  ZZ  ->  (
( ( N  x.  ( N  +  1
) )  /  2
)  e.  ZZ  <->  ( N  x.  ( ( N  + 
1 )  /  2
) )  e.  ZZ ) )
1918adantl 277 . . . . 5  |-  ( ( ( ( N  + 
1 )  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( ( N  x.  ( N  + 
1 ) )  / 
2 )  e.  ZZ  <->  ( N  x.  ( ( N  +  1 )  /  2 ) )  e.  ZZ ) )
2016, 19mpbird 167 . . . 4  |-  ( ( ( ( N  + 
1 )  /  2
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( N  x.  ( N  +  1
) )  /  2
)  e.  ZZ )
2120ex 115 . . 3  |-  ( ( ( N  +  1 )  /  2 )  e.  ZZ  ->  ( N  e.  ZZ  ->  ( ( N  x.  ( N  +  1 ) )  /  2 )  e.  ZZ ) )
2214, 21jaoi 721 . 2  |-  ( ( ( N  /  2
)  e.  ZZ  \/  ( ( N  + 
1 )  /  2
)  e.  ZZ )  ->  ( N  e.  ZZ  ->  ( ( N  x.  ( N  +  1 ) )  /  2 )  e.  ZZ ) )
231, 22mpcom 36 1  |-  ( N  e.  ZZ  ->  (
( N  x.  ( N  +  1 ) )  /  2 )  e.  ZZ )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713    e. wcel 2200   class class class wbr 4082  (class class class)co 6000   0cc0 7995   1c1 7996    + caddc 7998    x. cmul 8000   # cap 8724    / cdiv 8815   2c2 9157   ZZcz 9442
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-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113
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-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  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-br 4083  df-opab 4145  df-id 4383  df-po 4386  df-iso 4387  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-iota 5277  df-fun 5319  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-2 9165  df-n0 9366  df-z 9443
This theorem is referenced by:  sqoddm1div8z  12392
  Copyright terms: Public domain W3C validator