MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ruclem9 Structured version   Visualization version   GIF version

Theorem ruclem9 16448
Description: Lemma for ruc 16453. The first components of the 𝐺 sequence are increasing, and the second components are decreasing. (Contributed by Mario Carneiro, 28-May-2014.)
Hypotheses
Ref Expression
ruc.1 (𝜑 → 𝐹:ℕ⟶ℝ)
ruc.2 (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
ruc.4 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
ruc.5 𝐺 = seq0(𝐷, 𝐶)
ruclem9.6 (𝜑 → 𝑀 ∈ ℕ0)
ruclem9.7 (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
Assertion
Ref Expression
ruclem9 (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁)) ∧ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀))))
Distinct variable groups:   𝑥,𝑚,𝑦,𝐹   𝑚,𝐺,𝑥,𝑦   𝑚,𝑀,𝑥,𝑦   𝑚,𝑁,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑚)   𝐶(𝑥, 𝑦, 𝑚)   𝐷(𝑥, 𝑦, 𝑚)

Proof of Theorem ruclem9
Dummy variables 𝑛 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ruclem9.7 . 2 (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))
2 2fveq3 6920 . . . . . 6 (𝑘 = 𝑀 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘𝑀)))
32breq2d 5119 . . . . 5 (𝑘 = 𝑀 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑀))))
4 2fveq3 6920 . . . . . 6 (𝑘 = 𝑀 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘𝑀)))
54breq1d 5117 . . . . 5 (𝑘 = 𝑀 → ((2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)) ↔ (2nd ‘(𝐺‘𝑀)) ≤ (2nd ‘(𝐺‘𝑀))))
63, 5anbi12d 644 . . . 4 (𝑘 = 𝑀 → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀))) ↔ ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑀)) ∧ (2nd ‘(𝐺‘𝑀)) ≤ (2nd ‘(𝐺‘𝑀)))))
76imbi2d 343 . . 3 (𝑘 = 𝑀 → ((𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)))) ↔ (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑀)) ∧ (2nd ‘(𝐺‘𝑀)) ≤ (2nd ‘(𝐺‘𝑀))))))
8 2fveq3 6920 . . . . . 6 (𝑘 = 𝑛 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘𝑛)))
98breq2d 5119 . . . . 5 (𝑘 = 𝑛 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛))))
10 2fveq3 6920 . . . . . 6 (𝑘 = 𝑛 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘𝑛)))
1110breq1d 5117 . . . . 5 (𝑘 = 𝑛 → ((2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)) ↔ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))))
129, 11anbi12d 644 . . . 4 (𝑘 = 𝑛 → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀))) ↔ ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀)))))
1312imbi2d 343 . . 3 (𝑘 = 𝑛 → ((𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)))) ↔ (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))))))
14 2fveq3 6920 . . . . . 6 (𝑘 = (𝑛 + 1) → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘(𝑛 + 1))))
1514breq2d 5119 . . . . 5 (𝑘 = (𝑛 + 1) → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))))
16 2fveq3 6920 . . . . . 6 (𝑘 = (𝑛 + 1) → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘(𝑛 + 1))))
1716breq1d 5117 . . . . 5 (𝑘 = (𝑛 + 1) → ((2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)) ↔ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))
1815, 17anbi12d 644 . . . 4 (𝑘 = (𝑛 + 1) → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀))) ↔ ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1))) ∧ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀)))))
1918imbi2d 343 . . 3 (𝑘 = (𝑛 + 1) → ((𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)))) ↔ (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1))) ∧ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))))
20 2fveq3 6920 . . . . . 6 (𝑘 = 𝑁 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘𝑁)))
2120breq2d 5119 . . . . 5 (𝑘 = 𝑁 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁))))
22 2fveq3 6920 . . . . . 6 (𝑘 = 𝑁 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘𝑁)))
2322breq1d 5117 . . . . 5 (𝑘 = 𝑁 → ((2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)) ↔ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀))))
2421, 23anbi12d 644 . . . 4 (𝑘 = 𝑁 → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀))) ↔ ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁)) ∧ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀)))))
2524imbi2d 343 . . 3 (𝑘 = 𝑁 → ((𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑘)) ∧ (2nd ‘(𝐺‘𝑘)) ≤ (2nd ‘(𝐺‘𝑀)))) ↔ (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁)) ∧ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀))))))
26 ruc.1 . . . . . . . 8 (𝜑 → 𝐹:ℕ⟶ℝ)
27 ruc.2 . . . . . . . 8 (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
28 ruc.4 . . . . . . . 8 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
29 ruc.5 . . . . . . . 8 𝐺 = seq0(𝐷, 𝐶)
3026, 27, 28, 29ruclem6 16445 . . . . . . 7 (𝜑 → 𝐺:ℕ0⟶(ℝ × ℝ))
31 ruclem9.6 . . . . . . 7 (𝜑 → 𝑀 ∈ ℕ0)
3230, 31ffvelcdmd 7116 . . . . . 6 (𝜑 → (𝐺‘𝑀) ∈ (ℝ × ℝ))
33 xp1st 8066 . . . . . 6 ((𝐺‘𝑀) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘𝑀)) ∈ ℝ)
3432, 33syl 18 . . . . 5 (𝜑 → (1st ‘(𝐺‘𝑀)) ∈ ℝ)
3534leidd 11921 . . . 4 (𝜑 → (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑀)))
36 xp2nd 8067 . . . . . 6 ((𝐺‘𝑀) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘𝑀)) ∈ ℝ)
3732, 36syl 18 . . . . 5 (𝜑 → (2nd ‘(𝐺‘𝑀)) ∈ ℝ)
3837leidd 11921 . . . 4 (𝜑 → (2nd ‘(𝐺‘𝑀)) ≤ (2nd ‘(𝐺‘𝑀)))
3935, 38jca 521 . . 3 (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑀)) ∧ (2nd ‘(𝐺‘𝑀)) ≤ (2nd ‘(𝐺‘𝑀))))
4026adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝐹:ℕ⟶ℝ)
4127adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
4230adantr 486 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝐺:ℕ0⟶(ℝ × ℝ))
43 eluznn0 13083 . . . . . . . . . . . . 13 ((𝑀 ∈ ℕ0 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ ℕ0)
4431, 43sylan 592 . . . . . . . . . . . 12 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ ℕ0)
4542, 44ffvelcdmd 7116 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) ∈ (ℝ × ℝ))
46 xp1st 8066 . . . . . . . . . . 11 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘𝑛)) ∈ ℝ)
4745, 46syl 18 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘𝑛)) ∈ ℝ)
48 xp2nd 8067 . . . . . . . . . . 11 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘𝑛)) ∈ ℝ)
4945, 48syl 18 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(𝐺‘𝑛)) ∈ ℝ)
50 nn0p1nn 12684 . . . . . . . . . . . 12 (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ)
5144, 50syl 18 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝑛 + 1) ∈ ℕ)
5240, 51ffvelcdmd 7116 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
53 eqid 2766 . . . . . . . . . 10 (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
54 eqid 2766 . . . . . . . . . 10 (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
5526, 27, 28, 29ruclem8 16447 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ ℕ0) → (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))
5644, 55syldan 603 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))
5740, 41, 47, 49, 52, 53, 54, 56ruclem2 16442 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((1st ‘(𝐺‘𝑛)) ≤ (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) < (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ≤ (2nd ‘(𝐺‘𝑛))))
5857simp1d 1161 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘𝑛)) ≤ (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
5926, 27, 28, 29ruclem7 16446 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ ℕ0) → (𝐺‘(𝑛 + 1)) = ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))))
6044, 59syldan 603 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘(𝑛 + 1)) = ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))))
61 1st2nd2 8073 . . . . . . . . . . . 12 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (𝐺‘𝑛) = ⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩)
6245, 61syl 18 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘𝑛) = ⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩)
6362oveq1d 7465 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))) = (⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
6460, 63eqtrd 2801 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘(𝑛 + 1)) = (⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
6564fveq2d 6919 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘(𝑛 + 1))) = (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
6658, 65breqtrrd 5138 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘𝑛)) ≤ (1st ‘(𝐺‘(𝑛 + 1))))
6734adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘𝑀)) ∈ ℝ)
68 peano2nn0 12685 . . . . . . . . . . 11 (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ0)
6944, 68syl 18 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝑛 + 1) ∈ ℕ0)
7042, 69ffvelcdmd 7116 . . . . . . . . 9 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝐺‘(𝑛 + 1)) ∈ (ℝ × ℝ))
71 xp1st 8066 . . . . . . . . 9 ((𝐺‘(𝑛 + 1)) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘(𝑛 + 1))) ∈ ℝ)
7270, 71syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (1st ‘(𝐺‘(𝑛 + 1))) ∈ ℝ)
73 letr 11442 . . . . . . . 8 (((1st ‘(𝐺‘𝑀)) ∈ ℝ ∧ (1st ‘(𝐺‘𝑛)) ∈ ℝ ∧ (1st ‘(𝐺‘(𝑛 + 1))) ∈ ℝ) → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (1st ‘(𝐺‘𝑛)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))) → (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))))
7467, 47, 72, 73syl3anc 1401 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (1st ‘(𝐺‘𝑛)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))) → (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))))
7566, 74mpan2d 707 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) → (1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1)))))
7664fveq2d 6919 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(𝐺‘(𝑛 + 1))) = (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
7757simp3d 1163 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ≤ (2nd ‘(𝐺‘𝑛)))
7876, 77eqbrtrd 5132 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑛)))
79 xp2nd 8067 . . . . . . . . 9 ((𝐺‘(𝑛 + 1)) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘(𝑛 + 1))) ∈ ℝ)
8070, 79syl 18 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(𝐺‘(𝑛 + 1))) ∈ ℝ)
8137adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (2nd ‘(𝐺‘𝑀)) ∈ ℝ)
82 letr 11442 . . . . . . . 8 (((2nd ‘(𝐺‘(𝑛 + 1))) ∈ ℝ ∧ (2nd ‘(𝐺‘𝑛)) ∈ ℝ ∧ (2nd ‘(𝐺‘𝑀)) ∈ ℝ) → (((2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))) → (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))
8380, 49, 81, 82syl3anc 1401 . . . . . . 7 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (((2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))) → (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))
8478, 83mpand 708 . . . . . 6 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀)) → (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))
8575, 84anim12d 621 . . . . 5 ((𝜑 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))) → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1))) ∧ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀)))))
8685expcom 419 . . . 4 (𝑛 ∈ (ℤ≥‘𝑀) → (𝜑 → (((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀))) → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1))) ∧ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))))
8786a2d 30 . . 3 (𝑛 ∈ (ℤ≥‘𝑀) → ((𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑛)) ∧ (2nd ‘(𝐺‘𝑛)) ≤ (2nd ‘(𝐺‘𝑀)))) → (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘(𝑛 + 1))) ∧ (2nd ‘(𝐺‘(𝑛 + 1))) ≤ (2nd ‘(𝐺‘𝑀))))))
887, 13, 19, 25, 39, 87uzind4i 13076 . 2 (𝑁 ∈ (ℤ≥‘𝑀) → (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁)) ∧ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀)))))
891, 88mpcom 39 1 (𝜑 → ((1st ‘(𝐺‘𝑀)) ≤ (1st ‘(𝐺‘𝑁)) ∧ (2nd ‘(𝐺‘𝑁)) ≤ (2nd ‘(𝐺‘𝑀))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ⦋csb 3850   ∪ cun 4151  ifcif 4484  {csn 4587  ⟨cop 4839   class class class wbr 5107   × cxp 5655  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  1st c1st 8032  2nd c2nd 8033  ℝcr 11237  0cc0 11238  1c1 11239   + caddc 11241   < clt 11381   ≤ cle 11382   / cdiv 12012  ℕcn 12374  2c2 12436  ℕ0cn0 12645  ℤ≥cuz 13004  seqcseq 14183
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-div 12013  df-nn 12375  df-2 12444  df-n0 12646  df-z 12733  df-uz 13005  df-fz 13679  df-seq 14184
This theorem is used by:  ruclem10  16449
  Copyright terms: Public domain W3C validator