Metamath Proof Explorer


Theorem numltc

Description: Comparing two decimal integers (unequal higher places). (Contributed by Mario Carneiro, 18-Feb-2014)

Ref Expression
Hypotheses numlt.1 ⊢ T ∈ ℕ
numlt.2 ⊢ A ∈ ℕ 0
numlt.3 ⊢ B ∈ ℕ 0
numltc.3 ⊢ C ∈ ℕ 0
numltc.4 ⊢ D ∈ ℕ 0
numltc.5 ⊢ C < T
numltc.6 ⊢ A < B
Assertion numltc ⊢ T ⁢ A + C < T ⁢ B + D

Proof

Step Hyp Ref Expression
1 numlt.1 ⊢ T ∈ ℕ
2 numlt.2 ⊢ A ∈ ℕ 0
3 numlt.3 ⊢ B ∈ ℕ 0
4 numltc.3 ⊢ C ∈ ℕ 0
5 numltc.4 ⊢ D ∈ ℕ 0
6 numltc.5 ⊢ C < T
7 numltc.6 ⊢ A < B
8 1 2 4 1 6 numlt ⊢ T ⁢ A + C < T ⁢ A + T
9 1 nnrei ⊢ T ∈ ℝ
10 9 recni ⊢ T ∈ ℂ
11 2 nn0rei ⊢ A ∈ ℝ
12 11 recni ⊢ A ∈ ℂ
13 ax-1cn ⊢ 1 ∈ ℂ
14 10 12 13 adddii ⊢ T ⁢ A + 1 = T ⁢ A + T ⋅ 1
15 10 mulridi ⊢ T ⋅ 1 = T
16 15 oveq2i ⊢ T ⁢ A + T ⋅ 1 = T ⁢ A + T
17 14 16 eqtri ⊢ T ⁢ A + 1 = T ⁢ A + T
18 8 17 breqtrri ⊢ T ⁢ A + C < T ⁢ A + 1
19 nn0ltp1le ⊢ A ∈ ℕ 0 ∧ B ∈ ℕ 0 → A < B ↔ A + 1 ≤ B
20 2 3 19 mp2an ⊢ A < B ↔ A + 1 ≤ B
21 7 20 mpbi ⊢ A + 1 ≤ B
22 1 nngt0i ⊢ 0 < T
23 peano2re ⊢ A ∈ ℝ → A + 1 ∈ ℝ
24 11 23 ax-mp ⊢ A + 1 ∈ ℝ
25 3 nn0rei ⊢ B ∈ ℝ
26 24 25 9 lemul2i ⊢ 0 < T → A + 1 ≤ B ↔ T ⁢ A + 1 ≤ T ⁢ B
27 22 26 ax-mp ⊢ A + 1 ≤ B ↔ T ⁢ A + 1 ≤ T ⁢ B
28 21 27 mpbi ⊢ T ⁢ A + 1 ≤ T ⁢ B
29 9 11 remulcli ⊢ T ⁢ A ∈ ℝ
30 4 nn0rei ⊢ C ∈ ℝ
31 29 30 readdcli ⊢ T ⁢ A + C ∈ ℝ
32 9 24 remulcli ⊢ T ⁢ A + 1 ∈ ℝ
33 9 25 remulcli ⊢ T ⁢ B ∈ ℝ
34 31 32 33 ltletri ⊢ T ⁢ A + C < T ⁢ A + 1 ∧ T ⁢ A + 1 ≤ T ⁢ B → T ⁢ A + C < T ⁢ B
35 18 28 34 mp2an ⊢ T ⁢ A + C < T ⁢ B
36 33 5 nn0addge1i ⊢ T ⁢ B ≤ T ⁢ B + D
37 5 nn0rei ⊢ D ∈ ℝ
38 33 37 readdcli ⊢ T ⁢ B + D ∈ ℝ
39 31 33 38 ltletri ⊢ T ⁢ A + C < T ⁢ B ∧ T ⁢ B ≤ T ⁢ B + D → T ⁢ A + C < T ⁢ B + D
40 35 36 39 mp2an ⊢ T ⁢ A + C < T ⁢ B + D