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

Theorem ruclem8 16449
Description: Lemma for ruc 16455. The intervals of the 𝐺 sequence are all nonempty. (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(𝐷, 𝐶)
Assertion
Ref Expression
ruclem8 ((𝜑 ∧ 𝑁 ∈ ℕ0) → (1st ‘(𝐺‘𝑁)) < (2nd ‘(𝐺‘𝑁)))
Distinct variable groups:   𝑥,𝑚,𝑦,𝐹   𝑚,𝐺,𝑥,𝑦   𝑚,𝑁,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑚)   𝐶(𝑥, 𝑦, 𝑚)   𝐷(𝑥, 𝑦, 𝑚)

Proof of Theorem ruclem8
Dummy variables 𝑛 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2fveq3 6921 . . . . 5 (𝑘 = 0 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘0)))
2 2fveq3 6921 . . . . 5 (𝑘 = 0 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘0)))
31, 2breq12d 5121 . . . 4 (𝑘 = 0 → ((1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0))))
43imbi2d 343 . . 3 (𝑘 = 0 → ((𝜑 → (1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0)))))
5 2fveq3 6921 . . . . 5 (𝑘 = 𝑛 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘𝑛)))
6 2fveq3 6921 . . . . 5 (𝑘 = 𝑛 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘𝑛)))
75, 6breq12d 5121 . . . 4 (𝑘 = 𝑛 → ((1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛))))
87imbi2d 343 . . 3 (𝑘 = 𝑛 → ((𝜑 → (1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))))
9 2fveq3 6921 . . . . 5 (𝑘 = (𝑛 + 1) → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘(𝑛 + 1))))
10 2fveq3 6921 . . . . 5 (𝑘 = (𝑛 + 1) → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘(𝑛 + 1))))
119, 10breq12d 5121 . . . 4 (𝑘 = (𝑛 + 1) → ((1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1)))))
1211imbi2d 343 . . 3 (𝑘 = (𝑛 + 1) → ((𝜑 → (1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
13 2fveq3 6921 . . . . 5 (𝑘 = 𝑁 → (1st ‘(𝐺‘𝑘)) = (1st ‘(𝐺‘𝑁)))
14 2fveq3 6921 . . . . 5 (𝑘 = 𝑁 → (2nd ‘(𝐺‘𝑘)) = (2nd ‘(𝐺‘𝑁)))
1513, 14breq12d 5121 . . . 4 (𝑘 = 𝑁 → ((1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘)) ↔ (1st ‘(𝐺‘𝑁)) < (2nd ‘(𝐺‘𝑁))))
1615imbi2d 343 . . 3 (𝑘 = 𝑁 → ((𝜑 → (1st ‘(𝐺‘𝑘)) < (2nd ‘(𝐺‘𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘𝑁)) < (2nd ‘(𝐺‘𝑁)))))
17 0lt1 11878 . . . . 5 0 < 1
1817a1i 11 . . . 4 (𝜑 → 0 < 1)
19 ruc.1 . . . . . . 7 (𝜑 → 𝐹:ℕ⟶ℝ)
20 ruc.2 . . . . . . 7 (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
21 ruc.4 . . . . . . 7 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
22 ruc.5 . . . . . . 7 𝐺 = seq0(𝐷, 𝐶)
2319, 20, 21, 22ruclem4 16446 . . . . . 6 (𝜑 → (𝐺‘0) = ⟨0, 1⟩)
2423fveq2d 6920 . . . . 5 (𝜑 → (1st ‘(𝐺‘0)) = (1st ‘⟨0, 1⟩))
25 c0ex 11339 . . . . . 6 0 ∈ V
26 1ex 11342 . . . . . 6 1 ∈ V
2725, 26op1st 8043 . . . . 5 (1st ‘⟨0, 1⟩) = 0
2824, 27eqtrdi 2814 . . . 4 (𝜑 → (1st ‘(𝐺‘0)) = 0)
2923fveq2d 6920 . . . . 5 (𝜑 → (2nd ‘(𝐺‘0)) = (2nd ‘⟨0, 1⟩))
3025, 26op2nd 8044 . . . . 5 (2nd ‘⟨0, 1⟩) = 1
3129, 30eqtrdi 2814 . . . 4 (𝜑 → (2nd ‘(𝐺‘0)) = 1)
3218, 28, 313brtr4d 5143 . . 3 (𝜑 → (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0)))
3319adantr 486 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → 𝐹:ℕ⟶ℝ)
3420adantr 486 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
3519, 20, 21, 22ruclem6 16447 . . . . . . . . . . . 12 (𝜑 → 𝐺:ℕ0⟶(ℝ × ℝ))
3635ffvelcdmda 7116 . . . . . . . . . . 11 ((𝜑 ∧ 𝑛 ∈ ℕ0) → (𝐺‘𝑛) ∈ (ℝ × ℝ))
3736adantrr 730 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (𝐺‘𝑛) ∈ (ℝ × ℝ))
38 xp1st 8067 . . . . . . . . . 10 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (1st ‘(𝐺‘𝑛)) ∈ ℝ)
3937, 38syl 18 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (1st ‘(𝐺‘𝑛)) ∈ ℝ)
40 xp2nd 8068 . . . . . . . . . 10 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (2nd ‘(𝐺‘𝑛)) ∈ ℝ)
4137, 40syl 18 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (2nd ‘(𝐺‘𝑛)) ∈ ℝ)
42 nn0p1nn 12685 . . . . . . . . . . 11 (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ)
43 ffvelcdm 7113 . . . . . . . . . . 11 ((𝐹:ℕ⟶ℝ ∧ (𝑛 + 1) ∈ ℕ) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
4419, 42, 43syl2an 608 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ ℕ0) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
4544adantrr 730 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
46 eqid 2763 . . . . . . . . 9 (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
47 eqid 2763 . . . . . . . . 9 (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
48 simprr 785 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))
4933, 34, 39, 41, 45, 46, 47, 48ruclem2 16444 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → ((1st ‘(𝐺‘𝑛)) ≤ (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) < (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ≤ (2nd ‘(𝐺‘𝑛))))
5049simp2d 1161 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) < (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
5119, 20, 21, 22ruclem7 16448 . . . . . . . . . 10 ((𝜑 ∧ 𝑛 ∈ ℕ0) → (𝐺‘(𝑛 + 1)) = ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))))
5251adantrr 730 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (𝐺‘(𝑛 + 1)) = ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))))
53 1st2nd2 8074 . . . . . . . . . . 11 ((𝐺‘𝑛) ∈ (ℝ × ℝ) → (𝐺‘𝑛) = ⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩)
5437, 53syl 18 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (𝐺‘𝑛) = ⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩)
5554oveq1d 7466 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → ((𝐺‘𝑛)𝐷(𝐹‘(𝑛 + 1))) = (⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
5652, 55eqtrd 2798 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (𝐺‘(𝑛 + 1)) = (⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
5756fveq2d 6920 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (1st ‘(𝐺‘(𝑛 + 1))) = (1st ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
5856fveq2d 6920 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (2nd ‘(𝐺‘(𝑛 + 1))) = (2nd ‘(⟨(1st ‘(𝐺‘𝑛)), (2nd ‘(𝐺‘𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
5950, 57, 583brtr4d 5143 . . . . . 6 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)))) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))
6059expr 462 . . . . 5 ((𝜑 ∧ 𝑛 ∈ ℕ0) → ((1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1)))))
6160expcom 419 . . . 4 (𝑛 ∈ ℕ0 → (𝜑 → ((1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛)) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
6261a2d 30 . . 3 (𝑛 ∈ ℕ0 → ((𝜑 → (1st ‘(𝐺‘𝑛)) < (2nd ‘(𝐺‘𝑛))) → (𝜑 → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
634, 8, 12, 16, 32, 62nn0ind 12834 . 2 (𝑁 ∈ ℕ0 → (𝜑 → (1st ‘(𝐺‘𝑁)) < (2nd ‘(𝐺‘𝑁))))
6463impcom 413 1 ((𝜑 ∧ 𝑁 ∈ ℕ0) → (1st ‘(𝐺‘𝑁)) < (2nd ‘(𝐺‘𝑁)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⦋csb 3851   ∪ cun 4152  ifcif 4485  {csn 4588  ⟨cop 4840   class class class wbr 5108   × cxp 5656  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034  ℝcr 11238  0cc0 11239  1c1 11240   + caddc 11242   < clt 11382   ≤ cle 11383   / cdiv 12013  ℕcn 12375  2c2 12437  ℕ0cn0 12646  seqcseq 14184
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-seq 14185
This theorem is used by:  ruclem9  16450  ruclem10  16451  ruclem12  16453
  Copyright terms: Public domain W3C validator