Metamath Proof Explorer


Theorem nn0oddm1d2

Description: A positive integer is odd iff its predecessor divided by 2 is a positive integer. (Contributed by AV, 28-Jun-2021) (Proof shortened by AV, 10-Jul-2022)

Ref Expression
Assertion nn0oddm1d2 N0¬2NN120

Proof

Step Hyp Ref Expression
1 nn0z N0N
2 oddp1d2 N¬2NN+12
3 1 2 syl N0¬2NN+12
4 peano2nn0 N0N+10
5 4 nn0red N0N+1
6 2rp 2+
7 6 a1i N02+
8 nn0re N0N
9 1red N01
10 nn0ge0 N00N
11 0le1 01
12 11 a1i N001
13 8 9 10 12 addge0d N00N+1
14 5 7 13 divge0d N00N+12
15 14 anim1ci N0N+12N+120N+12
16 elnn0z N+120N+120N+12
17 15 16 sylibr N0N+12N+120
18 17 ex N0N+12N+120
19 nn0z N+120N+12
20 18 19 impbid1 N0N+12N+120
21 nn0ob N0N+120N120
22 3 20 21 3bitrd N0¬2NN120