Metamath Proof Explorer


Theorem digit1

Description: Two ways to express the K th digit in the decimal expansion of a number A (when base B = 1 0 ). K = 1 corresponds to the first digit after the decimal point. (Contributed by NM, 3-Jan-2009)

Ref Expression
Assertion digit1 ⊢ A ∈ ℝ ∧ B ∈ ℕ ∧ K ∈ ℕ → B K ⁢ A mod B = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K

Proof

Step Hyp Ref Expression
1 digit2 ⊢ A ∈ ℝ ∧ B ∈ ℕ ∧ K ∈ ℕ → B K ⁢ A mod B = B K ⁢ A − B ⁢ B K − 1 ⁢ A
2 1 3coml ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B = B K ⁢ A − B ⁢ B K − 1 ⁢ A
3 2 3expa ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B = B K ⁢ A − B ⁢ B K − 1 ⁢ A
4 3 oveq1d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B mod B K = B K ⁢ A − B ⁢ B K − 1 ⁢ A mod B K
5 nnre ⊢ B ∈ ℕ → B ∈ ℝ
6 nnnn0 ⊢ K ∈ ℕ → K ∈ ℕ 0
7 reexpcl ⊢ B ∈ ℝ ∧ K ∈ ℕ 0 → B K ∈ ℝ
8 5 6 7 syl2an ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K ∈ ℝ
9 remulcl ⊢ B K ∈ ℝ ∧ A ∈ ℝ → B K ⁢ A ∈ ℝ
10 8 9 sylan ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A ∈ ℝ
11 reflcl ⊢ B K ⁢ A ∈ ℝ → B K ⁢ A ∈ ℝ
12 10 11 syl ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A ∈ ℝ
13 nnrp ⊢ B ∈ ℕ → B ∈ ℝ +
14 13 ad2antrr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ∈ ℝ +
15 12 14 modcld ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B ∈ ℝ
16 nnexpcl ⊢ B ∈ ℕ ∧ K ∈ ℕ 0 → B K ∈ ℕ
17 6 16 sylan2 ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K ∈ ℕ
18 17 nnrpd ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K ∈ ℝ +
19 18 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ∈ ℝ +
20 modge0 ⊢ B K ⁢ A ∈ ℝ ∧ B ∈ ℝ + → 0 ≤ B K ⁢ A mod B
21 12 14 20 syl2anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → 0 ≤ B K ⁢ A mod B
22 5 ad2antrr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ∈ ℝ
23 8 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ∈ ℝ
24 modlt ⊢ B K ⁢ A ∈ ℝ ∧ B ∈ ℝ + → B K ⁢ A mod B < B
25 12 14 24 syl2anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B < B
26 nncn ⊢ B ∈ ℕ → B ∈ ℂ
27 exp1 ⊢ B ∈ ℂ → B 1 = B
28 26 27 syl ⊢ B ∈ ℕ → B 1 = B
29 28 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ → B 1 = B
30 5 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ → B ∈ ℝ
31 nnge1 ⊢ B ∈ ℕ → 1 ≤ B
32 31 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ → 1 ≤ B
33 simpr ⊢ B ∈ ℕ ∧ K ∈ ℕ → K ∈ ℕ
34 nnuz ⊢ ℕ = ℤ ≥ 1
35 33 34 eleqtrdi ⊢ B ∈ ℕ ∧ K ∈ ℕ → K ∈ ℤ ≥ 1
36 leexp2a ⊢ B ∈ ℝ ∧ 1 ≤ B ∧ K ∈ ℤ ≥ 1 → B 1 ≤ B K
37 30 32 35 36 syl3anc ⊢ B ∈ ℕ ∧ K ∈ ℕ → B 1 ≤ B K
38 29 37 eqbrtrrd ⊢ B ∈ ℕ ∧ K ∈ ℕ → B ≤ B K
39 38 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ≤ B K
40 15 22 23 25 39 ltletrd ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B < B K
41 modid ⊢ B K ⁢ A mod B ∈ ℝ ∧ B K ∈ ℝ + ∧ 0 ≤ B K ⁢ A mod B ∧ B K ⁢ A mod B < B K → B K ⁢ A mod B mod B K = B K ⁢ A mod B
42 15 19 21 40 41 syl22anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B mod B K = B K ⁢ A mod B
43 simpll ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ∈ ℕ
44 nnm1nn0 ⊢ K ∈ ℕ → K − 1 ∈ ℕ 0
45 reexpcl ⊢ B ∈ ℝ ∧ K − 1 ∈ ℕ 0 → B K − 1 ∈ ℝ
46 5 44 45 syl2an ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K − 1 ∈ ℝ
47 remulcl ⊢ B K − 1 ∈ ℝ ∧ A ∈ ℝ → B K − 1 ⁢ A ∈ ℝ
48 46 47 sylan ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K − 1 ⁢ A ∈ ℝ
49 nnexpcl ⊢ B ∈ ℕ ∧ K − 1 ∈ ℕ 0 → B K − 1 ∈ ℕ
50 44 49 sylan2 ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K − 1 ∈ ℕ
51 50 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K − 1 ∈ ℕ
52 modmulnn ⊢ B ∈ ℕ ∧ B K − 1 ⁢ A ∈ ℝ ∧ B K − 1 ∈ ℕ → B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1 ≤ B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1
53 43 48 51 52 syl3anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1 ≤ B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1
54 expm1t ⊢ B ∈ ℂ ∧ K ∈ ℕ → B K = B K − 1 ⁢ B
55 expcl ⊢ B ∈ ℂ ∧ K − 1 ∈ ℕ 0 → B K − 1 ∈ ℂ
56 44 55 sylan2 ⊢ B ∈ ℂ ∧ K ∈ ℕ → B K − 1 ∈ ℂ
57 simpl ⊢ B ∈ ℂ ∧ K ∈ ℕ → B ∈ ℂ
58 56 57 mulcomd ⊢ B ∈ ℂ ∧ K ∈ ℕ → B K − 1 ⁢ B = B ⁢ B K − 1
59 54 58 eqtrd ⊢ B ∈ ℂ ∧ K ∈ ℕ → B K = B ⁢ B K − 1
60 26 59 sylan ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K = B ⁢ B K − 1
61 60 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K = B ⁢ B K − 1
62 61 oveq2d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A mod B K = B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1
63 61 oveq1d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A = B ⁢ B K − 1 ⁢ A
64 26 ad2antrr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ∈ ℂ
65 26 44 55 syl2an ⊢ B ∈ ℕ ∧ K ∈ ℕ → B K − 1 ∈ ℂ
66 65 adantr ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K − 1 ∈ ℂ
67 recn ⊢ A ∈ ℝ → A ∈ ℂ
68 67 adantl ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → A ∈ ℂ
69 64 66 68 mulassd ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A = B ⁢ B K − 1 ⁢ A
70 63 69 eqtrd ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A = B ⁢ B K − 1 ⁢ A
71 70 fveq2d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A = B ⁢ B K − 1 ⁢ A
72 71 61 oveq12d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B K = B ⁢ B K − 1 ⁢ A mod B ⁢ B K − 1
73 53 62 72 3brtr4d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A mod B K ≤ B K ⁢ A mod B K
74 reflcl ⊢ B K − 1 ⁢ A ∈ ℝ → B K − 1 ⁢ A ∈ ℝ
75 48 74 syl ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K − 1 ⁢ A ∈ ℝ
76 remulcl ⊢ B ∈ ℝ ∧ B K − 1 ⁢ A ∈ ℝ → B ⁢ B K − 1 ⁢ A ∈ ℝ
77 22 75 76 syl2anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A ∈ ℝ
78 modsubdir ⊢ B K ⁢ A ∈ ℝ ∧ B ⁢ B K − 1 ⁢ A ∈ ℝ ∧ B K ∈ ℝ + → B ⁢ B K − 1 ⁢ A mod B K ≤ B K ⁢ A mod B K ↔ B K ⁢ A − B ⁢ B K − 1 ⁢ A mod B K = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K
79 12 77 19 78 syl3anc ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B ⁢ B K − 1 ⁢ A mod B K ≤ B K ⁢ A mod B K ↔ B K ⁢ A − B ⁢ B K − 1 ⁢ A mod B K = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K
80 73 79 mpbid ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A − B ⁢ B K − 1 ⁢ A mod B K = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K
81 4 42 80 3eqtr3d ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K
82 81 3impa ⊢ B ∈ ℕ ∧ K ∈ ℕ ∧ A ∈ ℝ → B K ⁢ A mod B = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K
83 82 3comr ⊢ A ∈ ℝ ∧ B ∈ ℕ ∧ K ∈ ℕ → B K ⁢ A mod B = B K ⁢ A mod B K − B ⁢ B K − 1 ⁢ A mod B K