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

Theorem ruclem8 15172
Description: Lemma for ruc 15178. 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 fveq2 6333 . . . . . 6 (𝑘 = 0 → (𝐺𝑘) = (𝐺‘0))
21fveq2d 6337 . . . . 5 (𝑘 = 0 → (1st ‘(𝐺𝑘)) = (1st ‘(𝐺‘0)))
31fveq2d 6337 . . . . 5 (𝑘 = 0 → (2nd ‘(𝐺𝑘)) = (2nd ‘(𝐺‘0)))
42, 3breq12d 4800 . . . 4 (𝑘 = 0 → ((1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘)) ↔ (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0))))
54imbi2d 329 . . 3 (𝑘 = 0 → ((𝜑 → (1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0)))))
6 fveq2 6333 . . . . . 6 (𝑘 = 𝑛 → (𝐺𝑘) = (𝐺𝑛))
76fveq2d 6337 . . . . 5 (𝑘 = 𝑛 → (1st ‘(𝐺𝑘)) = (1st ‘(𝐺𝑛)))
86fveq2d 6337 . . . . 5 (𝑘 = 𝑛 → (2nd ‘(𝐺𝑘)) = (2nd ‘(𝐺𝑛)))
97, 8breq12d 4800 . . . 4 (𝑘 = 𝑛 → ((1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘)) ↔ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛))))
109imbi2d 329 . . 3 (𝑘 = 𝑛 → ((𝜑 → (1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘))) ↔ (𝜑 → (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))))
11 fveq2 6333 . . . . . 6 (𝑘 = (𝑛 + 1) → (𝐺𝑘) = (𝐺‘(𝑛 + 1)))
1211fveq2d 6337 . . . . 5 (𝑘 = (𝑛 + 1) → (1st ‘(𝐺𝑘)) = (1st ‘(𝐺‘(𝑛 + 1))))
1311fveq2d 6337 . . . . 5 (𝑘 = (𝑛 + 1) → (2nd ‘(𝐺𝑘)) = (2nd ‘(𝐺‘(𝑛 + 1))))
1412, 13breq12d 4800 . . . 4 (𝑘 = (𝑛 + 1) → ((1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘)) ↔ (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1)))))
1514imbi2d 329 . . 3 (𝑘 = (𝑛 + 1) → ((𝜑 → (1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘))) ↔ (𝜑 → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
16 fveq2 6333 . . . . . 6 (𝑘 = 𝑁 → (𝐺𝑘) = (𝐺𝑁))
1716fveq2d 6337 . . . . 5 (𝑘 = 𝑁 → (1st ‘(𝐺𝑘)) = (1st ‘(𝐺𝑁)))
1816fveq2d 6337 . . . . 5 (𝑘 = 𝑁 → (2nd ‘(𝐺𝑘)) = (2nd ‘(𝐺𝑁)))
1917, 18breq12d 4800 . . . 4 (𝑘 = 𝑁 → ((1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘)) ↔ (1st ‘(𝐺𝑁)) < (2nd ‘(𝐺𝑁))))
2019imbi2d 329 . . 3 (𝑘 = 𝑁 → ((𝜑 → (1st ‘(𝐺𝑘)) < (2nd ‘(𝐺𝑘))) ↔ (𝜑 → (1st ‘(𝐺𝑁)) < (2nd ‘(𝐺𝑁)))))
21 0lt1 10756 . . . . 5 0 < 1
2221a1i 11 . . . 4 (𝜑 → 0 < 1)
23 ruc.1 . . . . . . 7 (𝜑𝐹:ℕ⟶ℝ)
24 ruc.2 . . . . . . 7 (𝜑𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ (((1st𝑥) + (2nd𝑥)) / 2) / 𝑚if(𝑚 < 𝑦, ⟨(1st𝑥), 𝑚⟩, ⟨((𝑚 + (2nd𝑥)) / 2), (2nd𝑥)⟩)))
25 ruc.4 . . . . . . 7 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
26 ruc.5 . . . . . . 7 𝐺 = seq0(𝐷, 𝐶)
2723, 24, 25, 26ruclem4 15169 . . . . . 6 (𝜑 → (𝐺‘0) = ⟨0, 1⟩)
2827fveq2d 6337 . . . . 5 (𝜑 → (1st ‘(𝐺‘0)) = (1st ‘⟨0, 1⟩))
29 c0ex 10240 . . . . . 6 0 ∈ V
30 1ex 10241 . . . . . 6 1 ∈ V
3129, 30op1st 7327 . . . . 5 (1st ‘⟨0, 1⟩) = 0
3228, 31syl6eq 2821 . . . 4 (𝜑 → (1st ‘(𝐺‘0)) = 0)
3327fveq2d 6337 . . . . 5 (𝜑 → (2nd ‘(𝐺‘0)) = (2nd ‘⟨0, 1⟩))
3429, 30op2nd 7328 . . . . 5 (2nd ‘⟨0, 1⟩) = 1
3533, 34syl6eq 2821 . . . 4 (𝜑 → (2nd ‘(𝐺‘0)) = 1)
3622, 32, 353brtr4d 4819 . . 3 (𝜑 → (1st ‘(𝐺‘0)) < (2nd ‘(𝐺‘0)))
3723adantr 466 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → 𝐹:ℕ⟶ℝ)
3824adantr 466 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ (((1st𝑥) + (2nd𝑥)) / 2) / 𝑚if(𝑚 < 𝑦, ⟨(1st𝑥), 𝑚⟩, ⟨((𝑚 + (2nd𝑥)) / 2), (2nd𝑥)⟩)))
3923, 24, 25, 26ruclem6 15170 . . . . . . . . . . . 12 (𝜑𝐺:ℕ0⟶(ℝ × ℝ))
4039ffvelrnda 6504 . . . . . . . . . . 11 ((𝜑𝑛 ∈ ℕ0) → (𝐺𝑛) ∈ (ℝ × ℝ))
4140adantrr 696 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (𝐺𝑛) ∈ (ℝ × ℝ))
42 xp1st 7351 . . . . . . . . . 10 ((𝐺𝑛) ∈ (ℝ × ℝ) → (1st ‘(𝐺𝑛)) ∈ ℝ)
4341, 42syl 17 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (1st ‘(𝐺𝑛)) ∈ ℝ)
44 xp2nd 7352 . . . . . . . . . 10 ((𝐺𝑛) ∈ (ℝ × ℝ) → (2nd ‘(𝐺𝑛)) ∈ ℝ)
4541, 44syl 17 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (2nd ‘(𝐺𝑛)) ∈ ℝ)
46 nn0p1nn 11539 . . . . . . . . . . 11 (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ)
47 ffvelrn 6502 . . . . . . . . . . 11 ((𝐹:ℕ⟶ℝ ∧ (𝑛 + 1) ∈ ℕ) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
4823, 46, 47syl2an 583 . . . . . . . . . 10 ((𝜑𝑛 ∈ ℕ0) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
4948adantrr 696 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (𝐹‘(𝑛 + 1)) ∈ ℝ)
50 eqid 2771 . . . . . . . . 9 (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
51 eqid 2771 . . . . . . . . 9 (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) = (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
52 simprr 756 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))
5337, 38, 43, 45, 49, 50, 51, 52ruclem2 15167 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → ((1st ‘(𝐺𝑛)) ≤ (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) < (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ∧ (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) ≤ (2nd ‘(𝐺𝑛))))
5453simp2d 1137 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))) < (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
5523, 24, 25, 26ruclem7 15171 . . . . . . . . . 10 ((𝜑𝑛 ∈ ℕ0) → (𝐺‘(𝑛 + 1)) = ((𝐺𝑛)𝐷(𝐹‘(𝑛 + 1))))
5655adantrr 696 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (𝐺‘(𝑛 + 1)) = ((𝐺𝑛)𝐷(𝐹‘(𝑛 + 1))))
57 1st2nd2 7358 . . . . . . . . . . 11 ((𝐺𝑛) ∈ (ℝ × ℝ) → (𝐺𝑛) = ⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩)
5841, 57syl 17 . . . . . . . . . 10 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (𝐺𝑛) = ⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩)
5958oveq1d 6811 . . . . . . . . 9 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → ((𝐺𝑛)𝐷(𝐹‘(𝑛 + 1))) = (⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
6056, 59eqtrd 2805 . . . . . . . 8 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (𝐺‘(𝑛 + 1)) = (⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1))))
6160fveq2d 6337 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (1st ‘(𝐺‘(𝑛 + 1))) = (1st ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
6260fveq2d 6337 . . . . . . 7 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (2nd ‘(𝐺‘(𝑛 + 1))) = (2nd ‘(⟨(1st ‘(𝐺𝑛)), (2nd ‘(𝐺𝑛))⟩𝐷(𝐹‘(𝑛 + 1)))))
6354, 61, 623brtr4d 4819 . . . . . 6 ((𝜑 ∧ (𝑛 ∈ ℕ0 ∧ (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)))) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))
6463expr 444 . . . . 5 ((𝜑𝑛 ∈ ℕ0) → ((1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1)))))
6564expcom 398 . . . 4 (𝑛 ∈ ℕ0 → (𝜑 → ((1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛)) → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
6665a2d 29 . . 3 (𝑛 ∈ ℕ0 → ((𝜑 → (1st ‘(𝐺𝑛)) < (2nd ‘(𝐺𝑛))) → (𝜑 → (1st ‘(𝐺‘(𝑛 + 1))) < (2nd ‘(𝐺‘(𝑛 + 1))))))
675, 10, 15, 20, 36, 66nn0ind 11679 . 2 (𝑁 ∈ ℕ0 → (𝜑 → (1st ‘(𝐺𝑁)) < (2nd ‘(𝐺𝑁))))
6867impcom 394 1 ((𝜑𝑁 ∈ ℕ0) → (1st ‘(𝐺𝑁)) < (2nd ‘(𝐺𝑁)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382   = wceq 1631  wcel 2145  csb 3682  cun 3721  ifcif 4226  {csn 4317  cop 4323   class class class wbr 4787   × cxp 5248  wf 6026  cfv 6030  (class class class)co 6796  cmpt2 6798  1st c1st 7317  2nd c2nd 7318  cr 10141  0cc0 10142  1c1 10143   + caddc 10145   < clt 10280  cle 10281   / cdiv 10890  cn 11226  2c2 11276  0cn0 11499  seqcseq 13008
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035  ax-un 7100  ax-cnex 10198  ax-resscn 10199  ax-1cn 10200  ax-icn 10201  ax-addcl 10202  ax-addrcl 10203  ax-mulcl 10204  ax-mulrcl 10205  ax-mulcom 10206  ax-addass 10207  ax-mulass 10208  ax-distr 10209  ax-i2m1 10210  ax-1ne0 10211  ax-1rid 10212  ax-rnegex 10213  ax-rrecex 10214  ax-cnre 10215  ax-pre-lttri 10216  ax-pre-lttrn 10217  ax-pre-ltadd 10218  ax-pre-mulgt0 10219
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3or 1072  df-3an 1073  df-tru 1634  df-fal 1637  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-tp 4322  df-op 4324  df-uni 4576  df-iun 4657  df-br 4788  df-opab 4848  df-mpt 4865  df-tr 4888  df-id 5158  df-eprel 5163  df-po 5171  df-so 5172  df-fr 5209  df-we 5211  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-pred 5822  df-ord 5868  df-on 5869  df-lim 5870  df-suc 5871  df-iota 5993  df-fun 6032  df-fn 6033  df-f 6034  df-f1 6035  df-fo 6036  df-f1o 6037  df-fv 6038  df-riota 6757  df-ov 6799  df-oprab 6800  df-mpt2 6801  df-om 7217  df-1st 7319  df-2nd 7320  df-wrecs 7563  df-recs 7625  df-rdg 7663  df-er 7900  df-en 8114  df-dom 8115  df-sdom 8116  df-pnf 10282  df-mnf 10283  df-xr 10284  df-ltxr 10285  df-le 10286  df-sub 10474  df-neg 10475  df-div 10891  df-nn 11227  df-2 11285  df-n0 11500  df-z 11585  df-uz 11894  df-fz 12534  df-seq 13009
This theorem is referenced by:  ruclem9  15173  ruclem10  15174  ruclem12  15176
  Copyright terms: Public domain W3C validator