Metamath Proof Explorer


Theorem nnpw2pb

Description: A number is a positive integer iff it can be represented as the sum of a power of 2 and a "remainder" less than the power. (Contributed by AV, 31-May-2020)

Ref Expression
Assertion nnpw2pb ⊢ N ∈ ℕ ↔ ∃ i ∈ ℕ 0 ∃ r ∈ 0 ..^ 2 i N = 2 i + r

Proof

Step Hyp Ref Expression
1 nnpw2p ⊢ N ∈ ℕ → ∃ i ∈ ℕ 0 ∃ r ∈ 0 ..^ 2 i N = 2 i + r
2 2nn ⊢ 2 ∈ ℕ
3 nnexpcl ⊢ 2 ∈ ℕ ∧ i ∈ ℕ 0 → 2 i ∈ ℕ
4 2 3 mpan ⊢ i ∈ ℕ 0 → 2 i ∈ ℕ
5 elfzonn0 ⊢ r ∈ 0 ..^ 2 i → r ∈ ℕ 0
6 nnnn0addcl ⊢ 2 i ∈ ℕ ∧ r ∈ ℕ 0 → 2 i + r ∈ ℕ
7 4 5 6 syl2an ⊢ i ∈ ℕ 0 ∧ r ∈ 0 ..^ 2 i → 2 i + r ∈ ℕ
8 eleq1 ⊢ N = 2 i + r → N ∈ ℕ ↔ 2 i + r ∈ ℕ
9 7 8 syl5ibrcom ⊢ i ∈ ℕ 0 ∧ r ∈ 0 ..^ 2 i → N = 2 i + r → N ∈ ℕ
10 9 rexlimivv ⊢ ∃ i ∈ ℕ 0 ∃ r ∈ 0 ..^ 2 i N = 2 i + r → N ∈ ℕ
11 1 10 impbii ⊢ N ∈ ℕ ↔ ∃ i ∈ ℕ 0 ∃ r ∈ 0 ..^ 2 i N = 2 i + r