ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulsucdiv2z Unicode version
Theorem mulsucdiv2z 12630
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 9730 . 2 |- ( N e. ZZ -> ( ( N / 2 ) e. ZZ \/ ( ( N + 1 ) / 2 ) e. ZZ ) )
2 peano2z 9659 . . . . . 6 |- ( N e. ZZ -> ( N + 1 ) e. ZZ )
3 zmulcl 9677 . . . . . 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 9628 . . . . . . . 8 |- ( N e. ZZ -> N e. CC )
62zcnd 9748 . . . . . . . 8 |- ( N e. ZZ -> ( N + 1 ) e. CC )
7 2cnd 9356 . . . . . . . 8 |- ( N e. ZZ -> 2 e. CC )
8 2ap0 9376 . . . . . . . . 9 |- 2 # 0
98a1i 9 . . . . . . . 8 |- ( N e. ZZ -> 2 # 0 )
105, 6, 7, 9div23apd 9148 . . . . . . 7 |- ( N e. ZZ -> ( ( N x. ( N + 1 ) ) / 2 ) = ( ( N / 2 ) x. ( N + 1 ) ) )
1110eleq1d 2307 . . . . . 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 9677 . . . . . 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 9146 . . . . . . 7 |- ( N e. ZZ -> ( ( N x. ( N + 1 ) ) / 2 ) = ( N x. ( ( N + 1 ) / 2 ) ) )
1817eleq1d 2307 . . . . . 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 728 . 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 720   e. wcel 2209   class class class wbr 4125  (class class class)co 6075   0cc0 8169   1c1 8170   + caddc 8172   x. cmul 8174   # cap 8899   / cdiv 8992   2c2 9334   ZZcz 9623
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 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-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem depends on definitions:  df-bi 117  df-3or 1010  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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-po 4436  df-iso 4437  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-n0 9543  df-z 9624
This theorem is referenced by:  sqoddm1div8z  12631
  Copyright terms: Public domain W3C validator