Metamath Proof Explorer


Theorem dig2nn0

Description: A digit of a nonnegative integer N in a binary system is either 0 or 1. (Contributed by AV, 24-May-2020)

Ref Expression
Assertion dig2nn0 ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → K digit ⁡ 2 N ∈ 0 1

Proof

Step Hyp Ref Expression
1 2nn ⊢ 2 ∈ ℕ
2 1 a1i ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 ∈ ℕ
3 simpr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → K ∈ ℤ
4 nn0rp0 ⊢ N ∈ ℕ 0 → N ∈ 0 +∞
5 4 adantr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → N ∈ 0 +∞
6 digval ⊢ 2 ∈ ℕ ∧ K ∈ ℤ ∧ N ∈ 0 +∞ → K digit ⁡ 2 N = 2 − K ⋅ N mod 2
7 2 3 5 6 syl3anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → K digit ⁡ 2 N = 2 − K ⋅ N mod 2
8 2re ⊢ 2 ∈ ℝ
9 8 a1i ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 ∈ ℝ
10 2ne0 ⊢ 2 ≠ 0
11 10 a1i ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 ≠ 0
12 znegcl ⊢ K ∈ ℤ → − K ∈ ℤ
13 12 adantl ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → − K ∈ ℤ
14 9 11 13 reexpclzd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 − K ∈ ℝ
15 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
16 15 adantr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → N ∈ ℝ
17 14 16 remulcld ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 − K ⋅ N ∈ ℝ
18 17 flcld ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 − K ⋅ N ∈ ℤ
19 elmod2 ⊢ 2 − K ⋅ N ∈ ℤ → 2 − K ⋅ N mod 2 ∈ 0 1
20 18 19 syl ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → 2 − K ⋅ N mod 2 ∈ 0 1
21 7 20 eqeltrd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → K digit ⁡ 2 N ∈ 0 1