Metamath Proof Explorer


Theorem nn0ofldiv2

Description: The floor of an odd nonnegative integer divided by 2 is equal to the integer first decreased by 1 and then divided by 2. (Contributed by AV, 1-Jun-2020) (Proof shortened by AV, 7-Jun-2020)

Ref Expression
Assertion nn0ofldiv2 N 0 N + 1 2 0 N 2 = N 1 2

Proof

Step Hyp Ref Expression
1 nn0z N 0 N
2 nn0z N + 1 2 0 N + 1 2
3 zofldiv2 N N + 1 2 N 2 = N 1 2
4 1 2 3 syl2an N 0 N + 1 2 0 N 2 = N 1 2