Metamath Proof Explorer


Theorem 1lt2nq

Description: One is less than two (one plus one). (Contributed by NM, 13-Mar-1996) (Revised by Mario Carneiro, 10-May-2013) (New usage is discouraged.)

Ref Expression
Assertion 1lt2nq ⊢ 1 𝑸 < 𝑸 1 𝑸 + 𝑸 1 𝑸

Proof

Step Hyp Ref Expression
1 1lt2pi ⊢ 1 𝑜 < 𝑵 1 𝑜 + 𝑵 1 𝑜
2 1pi ⊢ 1 𝑜 ∈ 𝑵
3 mulidpi ⊢ 1 𝑜 ∈ 𝑵 → 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜
4 2 3 ax-mp ⊢ 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜
5 addclpi ⊢ 1 𝑜 ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 → 1 𝑜 + 𝑵 1 𝑜 ∈ 𝑵
6 2 2 5 mp2an ⊢ 1 𝑜 + 𝑵 1 𝑜 ∈ 𝑵
7 mulidpi ⊢ 1 𝑜 + 𝑵 1 𝑜 ∈ 𝑵 → 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜 + 𝑵 1 𝑜
8 6 7 ax-mp ⊢ 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜 + 𝑵 1 𝑜
9 1 4 8 3brtr4i ⊢ 1 𝑜 ⋅ 𝑵 1 𝑜 < 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜
10 ordpipq ⊢ 1 𝑜 1 𝑜 < 𝑝𝑸 1 𝑜 + 𝑵 1 𝑜 1 𝑜 ↔ 1 𝑜 ⋅ 𝑵 1 𝑜 < 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜
11 9 10 mpbir ⊢ 1 𝑜 1 𝑜 < 𝑝𝑸 1 𝑜 + 𝑵 1 𝑜 1 𝑜
12 df-1nq ⊢ 1 𝑸 = 1 𝑜 1 𝑜
13 12 12 oveq12i ⊢ 1 𝑸 + 𝑝𝑸 1 𝑸 = 1 𝑜 1 𝑜 + 𝑝𝑸 1 𝑜 1 𝑜
14 addpipq ⊢ 1 𝑜 ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 ∧ 1 𝑜 ∈ 𝑵 → 1 𝑜 1 𝑜 + 𝑝𝑸 1 𝑜 1 𝑜 = 1 𝑜 ⋅ 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 1 𝑜 ⋅ 𝑵 1 𝑜
15 2 2 2 2 14 mp4an ⊢ 1 𝑜 1 𝑜 + 𝑝𝑸 1 𝑜 1 𝑜 = 1 𝑜 ⋅ 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 1 𝑜 ⋅ 𝑵 1 𝑜
16 4 4 oveq12i ⊢ 1 𝑜 ⋅ 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜 + 𝑵 1 𝑜
17 16 4 opeq12i ⊢ 1 𝑜 ⋅ 𝑵 1 𝑜 + 𝑵 1 𝑜 ⋅ 𝑵 1 𝑜 1 𝑜 ⋅ 𝑵 1 𝑜 = 1 𝑜 + 𝑵 1 𝑜 1 𝑜
18 13 15 17 3eqtri ⊢ 1 𝑸 + 𝑝𝑸 1 𝑸 = 1 𝑜 + 𝑵 1 𝑜 1 𝑜
19 11 12 18 3brtr4i ⊢ 1 𝑸 < 𝑝𝑸 1 𝑸 + 𝑝𝑸 1 𝑸
20 lterpq ⊢ 1 𝑸 < 𝑝𝑸 1 𝑸 + 𝑝𝑸 1 𝑸 ↔ / 𝑸 ⁡ 1 𝑸 < 𝑸 / 𝑸 ⁡ 1 𝑸 + 𝑝𝑸 1 𝑸
21 19 20 mpbi ⊢ / 𝑸 ⁡ 1 𝑸 < 𝑸 / 𝑸 ⁡ 1 𝑸 + 𝑝𝑸 1 𝑸
22 1nq ⊢ 1 𝑸 ∈ 𝑸
23 nqerid ⊢ 1 𝑸 ∈ 𝑸 → / 𝑸 ⁡ 1 𝑸 = 1 𝑸
24 22 23 ax-mp ⊢ / 𝑸 ⁡ 1 𝑸 = 1 𝑸
25 24 eqcomi ⊢ 1 𝑸 = / 𝑸 ⁡ 1 𝑸
26 addpqnq ⊢ 1 𝑸 ∈ 𝑸 ∧ 1 𝑸 ∈ 𝑸 → 1 𝑸 + 𝑸 1 𝑸 = / 𝑸 ⁡ 1 𝑸 + 𝑝𝑸 1 𝑸
27 22 22 26 mp2an ⊢ 1 𝑸 + 𝑸 1 𝑸 = / 𝑸 ⁡ 1 𝑸 + 𝑝𝑸 1 𝑸
28 21 25 27 3brtr4i ⊢ 1 𝑸 < 𝑸 1 𝑸 + 𝑸 1 𝑸