Metamath Proof Explorer


Theorem rmygeid

Description: Y(n) increases faster than n. Used implicitly without proof or comment in lemma 2.27 of JonesMatijasevic p. 697. (Contributed by Stefan O'Rear, 4-Oct-2014)

Ref Expression
Assertion rmygeid ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 → N ≤ A Y rm N

Proof

Step Hyp Ref Expression
1 id ⊢ a = 0 → a = 0
2 oveq2 ⊢ a = 0 → A Y rm a = A Y rm 0
3 1 2 breq12d ⊢ a = 0 → a ≤ A Y rm a ↔ 0 ≤ A Y rm 0
4 3 imbi2d ⊢ a = 0 → A ∈ ℤ ≥ 2 → a ≤ A Y rm a ↔ A ∈ ℤ ≥ 2 → 0 ≤ A Y rm 0
5 id ⊢ a = b → a = b
6 oveq2 ⊢ a = b → A Y rm a = A Y rm b
7 5 6 breq12d ⊢ a = b → a ≤ A Y rm a ↔ b ≤ A Y rm b
8 7 imbi2d ⊢ a = b → A ∈ ℤ ≥ 2 → a ≤ A Y rm a ↔ A ∈ ℤ ≥ 2 → b ≤ A Y rm b
9 id ⊢ a = b + 1 → a = b + 1
10 oveq2 ⊢ a = b + 1 → A Y rm a = A Y rm b + 1
11 9 10 breq12d ⊢ a = b + 1 → a ≤ A Y rm a ↔ b + 1 ≤ A Y rm b + 1
12 11 imbi2d ⊢ a = b + 1 → A ∈ ℤ ≥ 2 → a ≤ A Y rm a ↔ A ∈ ℤ ≥ 2 → b + 1 ≤ A Y rm b + 1
13 id ⊢ a = N → a = N
14 oveq2 ⊢ a = N → A Y rm a = A Y rm N
15 13 14 breq12d ⊢ a = N → a ≤ A Y rm a ↔ N ≤ A Y rm N
16 15 imbi2d ⊢ a = N → A ∈ ℤ ≥ 2 → a ≤ A Y rm a ↔ A ∈ ℤ ≥ 2 → N ≤ A Y rm N
17 0le0 ⊢ 0 ≤ 0
18 rmy0 ⊢ A ∈ ℤ ≥ 2 → A Y rm 0 = 0
19 17 18 breqtrrid ⊢ A ∈ ℤ ≥ 2 → 0 ≤ A Y rm 0
20 nn0z ⊢ b ∈ ℕ 0 → b ∈ ℤ
21 20 3ad2ant1 ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b ∈ ℤ
22 21 peano2zd ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b + 1 ∈ ℤ
23 22 zred ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b + 1 ∈ ℝ
24 simp2 ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A ∈ ℤ ≥ 2
25 frmy ⊢ Y rm : ℤ ≥ 2 × ℤ ⟶ ℤ
26 25 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℤ → A Y rm b ∈ ℤ
27 24 21 26 syl2anc ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b ∈ ℤ
28 27 peano2zd ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b + 1 ∈ ℤ
29 28 zred ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b + 1 ∈ ℝ
30 25 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ b + 1 ∈ ℤ → A Y rm b + 1 ∈ ℤ
31 24 22 30 syl2anc ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b + 1 ∈ ℤ
32 31 zred ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b + 1 ∈ ℝ
33 nn0re ⊢ b ∈ ℕ 0 → b ∈ ℝ
34 33 3ad2ant1 ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b ∈ ℝ
35 27 zred ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b ∈ ℝ
36 1red ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → 1 ∈ ℝ
37 simp3 ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b ≤ A Y rm b
38 34 35 36 37 leadd1dd ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b + 1 ≤ A Y rm b + 1
39 34 ltp1d ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b < b + 1
40 ltrmy ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℤ ∧ b + 1 ∈ ℤ → b < b + 1 ↔ A Y rm b < A Y rm b + 1
41 24 21 22 40 syl3anc ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b < b + 1 ↔ A Y rm b < A Y rm b + 1
42 39 41 mpbid ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b < A Y rm b + 1
43 zltp1le ⊢ A Y rm b ∈ ℤ ∧ A Y rm b + 1 ∈ ℤ → A Y rm b < A Y rm b + 1 ↔ A Y rm b + 1 ≤ A Y rm b + 1
44 27 31 43 syl2anc ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b < A Y rm b + 1 ↔ A Y rm b + 1 ≤ A Y rm b + 1
45 42 44 mpbid ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → A Y rm b + 1 ≤ A Y rm b + 1
46 23 29 32 38 45 letrd ⊢ b ∈ ℕ 0 ∧ A ∈ ℤ ≥ 2 ∧ b ≤ A Y rm b → b + 1 ≤ A Y rm b + 1
47 46 3exp ⊢ b ∈ ℕ 0 → A ∈ ℤ ≥ 2 → b ≤ A Y rm b → b + 1 ≤ A Y rm b + 1
48 47 a2d ⊢ b ∈ ℕ 0 → A ∈ ℤ ≥ 2 → b ≤ A Y rm b → A ∈ ℤ ≥ 2 → b + 1 ≤ A Y rm b + 1
49 4 8 12 16 19 48 nn0ind ⊢ N ∈ ℕ 0 → A ∈ ℤ ≥ 2 → N ≤ A Y rm N
50 49 impcom ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 → N ≤ A Y rm N