HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem ruclem25 4909
Description: Lemma for ruc 4924. At any index A, the value of G is less than the value of H.
Hypotheses
Ref Expression
ruclem.0 F:ℕ–→ℝ
ruclem.1 C = ({⟨1, ⟨((F ‘1) + 1), ((F ‘1) + 2)⟩⟩} ∪ (F ↾ (ℕ ∖ {1})))
ruclem.2 D = {⟨⟨x, y⟩, z⟩∣((x ∈ (ℝ × ℝ) ∧ y ∈ ℝ) ∧ z = if(((1stx) < yy < (2ndx)), ⟨(((2 · y) + (2ndx)) / 3), ((y + (2 · (2ndx))) / 3)⟩, ⟨(((2 · (1stx)) + (2ndx)) / 3), (((1stx) + (2 · (2ndx))) / 3)⟩))}
ruclem.3 G = (1st ∘ (DseqC))
ruclem.4 H = (2nd ∘ (DseqC))
ruclem18.a A ∈ ℕ
Assertion
Ref Expression
ruclem25 (GA) < (HA)
Distinct variable group(s):   x,y,z   z,F

Proof of Theorem ruclem25
StepHypRef Expression
1 ruclem18.a . 2 A ∈ ℕ
2 fveq2 2832 . . . 4 (w = 1 → (Gw) = (G ‘1))
3 fveq2 2832 . . . 4 (w = 1 → (Hw) = (H ‘1))
42, 3breq12d 2073 . . 3 (w = 1 → ((Gw) < (Hw) ↔ (G ‘1) < (H ‘1)))
5 fveq2 2832 . . . 4 (w = v → (Gw) = (Gv))
6 fveq2 2832 . . . 4 (w = v → (Hw) = (Hv))
75, 6breq12d 2073 . . 3 (w = v → ((Gw) < (Hw) ↔ (Gv) < (Hv)))
8 fveq2 2832 . . . 4 (w = (v + 1) → (Gw) = (G ‘(v + 1)))
9 fveq2 2832 . . . 4 (w = (v + 1) → (Hw) = (H ‘(v + 1)))
108, 9breq12d 2073 . . 3 (w = (v + 1) → ((Gw) < (Hw) ↔ (G ‘(v + 1)) < (H ‘(v + 1))))
11 fveq2 2832 . . . 4 (w = A → (Gw) = (GA))
12 fveq2 2832 . . . 4 (w = A → (Hw) = (HA))
1311, 12breq12d 2073 . . 3 (w = A → ((Gw) < (Hw) ↔ (GA) < (HA)))
14 ax1re 4064 . . . . . . 7 1 ∈ ℝ
1514ltplus1 4384 . . . . . 6 1 < (1 + 1)
16 df-2 4462 . . . . . 6 2 = (1 + 1)
1715, 16breqtrr 2082 . . . . 5 1 < 2
18 2re 4470 . . . . . 6 2 ∈ ℝ
19 ruclem.0 . . . . . . 7 F:ℕ–→ℝ
20 1nn 4432 . . . . . . 7 1 ∈ ℕ
21 ffvrn 2890 . . . . . . 7 ((F:ℕ–→ℝ ∧ 1 ∈ ℕ) → (F ‘1) ∈ ℝ)
2219, 20, 21mp2an 520 . . . . . 6 (F ‘1) ∈ ℝ
2314, 18, 22ltadd2 4312 . . . . 5 (1 < 2 ↔ ((F ‘1) + 1) < ((F ‘1) + 2))
2417, 23mpbi 164 . . . 4 ((F ‘1) + 1) < ((F ‘1) + 2)
25 ruclem.1 . . . . 5 C = ({⟨1, ⟨((F ‘1) + 1), ((F ‘1) + 2)⟩⟩} ∪ (F ↾ (ℕ ∖ {1})))
26 ruclem.2 . . . . 5 D = {⟨⟨x, y⟩, z⟩∣((x ∈ (ℝ × ℝ) ∧ y ∈ ℝ) ∧ z = if(((1stx) < yy < (2ndx)), ⟨(((2 · y) + (2ndx)) / 3), ((y + (2 · (2ndx))) / 3)⟩, ⟨(((2 · (1stx)) + (2ndx)) / 3), (((1stx) + (2 · (2ndx))) / 3)⟩))}
27 ruclem.3 . . . . 5 G = (1st ∘ (DseqC))
28 ruclem.4 . . . . 5 H = (2nd ∘ (DseqC))
2919, 25, 26, 27, 28ruclem16 4900 . . . 4 (G ‘1) = ((F ‘1) + 1)
3019, 25, 26, 27, 28ruclem14 4898 . . . . . 6 ((DseqC) ‘1) = ⟨((F ‘1) + 1), ((F ‘1) + 2)⟩
3130fveq2i 2835 . . . . 5 (2nd ‘((DseqC) ‘1)) = (2nd ‘⟨((F ‘1) + 1), ((F ‘1) + 2)⟩)
3226ruclem9 4893 . . . . . 6 DV
3319, 25ruclem5 4889 . . . . . 6 CV
3420, 32, 33, 28ruclem11 4895 . . . . 5 (2nd ‘((DseqC) ‘1)) = (H ‘1)
35 oprex 3018 . . . . . 6 ((F ‘1) + 1) ∈ V
36 oprex 3018 . . . . . 6 ((F ‘1) + 2) ∈ V
3735, 36op2nd 3092 . . . . 5 (2nd ‘⟨((F ‘1) + 1), ((F ‘1) + 2)⟩) = ((F ‘1) + 2)
3831, 34, 373eqtr3 1124 . . . 4 (H ‘1) = ((F ‘1) + 2)
3924, 29, 383brtr4 2085 . . 3 (G ‘1) < (H ‘1)
40 fveq2 2832 . . . . . 6 (v = if(v ∈ ℕ, v, 1) → (Gv) = (G ‘if(v ∈ ℕ, v, 1)))
41 fveq2 2832 . . . . . 6 (v = if(v ∈ ℕ, v, 1) → (Hv) = (H ‘if(v ∈ ℕ, v, 1)))
4240, 41breq12d 2073 . . . . 5 (v = if(v ∈ ℕ, v, 1) → ((Gv) < (Hv) ↔ (G ‘if(v ∈ ℕ, v, 1)) < (H ‘if(v ∈ ℕ, v, 1))))
43 opreq1 3006 . . . . . . 7 (v = if(v ∈ ℕ, v, 1) → (v + 1) = (if(v ∈ ℕ, v, 1) + 1))
4443fveq2d 2836 . . . . . 6 (v = if(v ∈ ℕ, v, 1) → (G ‘(v + 1)) = (G ‘(if(v ∈ ℕ, v, 1) + 1)))
4543fveq2d 2836 . . . . . 6 (v = if(v ∈ ℕ, v, 1) → (H ‘(v + 1)) = (H ‘(if(v ∈ ℕ, v, 1) + 1)))
4644, 45breq12d 2073 . . . . 5 (v = if(v ∈ ℕ, v, 1) → ((G ‘(v + 1)) < (H ‘(v + 1)) ↔ (G ‘(if(v ∈ ℕ, v, 1) + 1)) < (H ‘(if(v ∈ ℕ, v, 1) + 1))))
4742, 46imbi12d 474 . . . 4 (v = if(v ∈ ℕ, v, 1) → (((Gv) < (Hv) → (G ‘(v + 1)) < (H ‘(v + 1))) ↔ ((G ‘if(v ∈ ℕ, v, 1)) < (H ‘if(v ∈ ℕ, v, 1)) → (G ‘(if(v ∈ ℕ, v, 1) + 1)) < (H ‘(if(v ∈ ℕ, v, 1) + 1)))))
4820elimel 1793 . . . . 5 if(v ∈ ℕ, v, 1) ∈ ℕ
4919, 25, 26, 27, 28, 48ruclem24 4908 . . . 4 ((G ‘if(v ∈ ℕ, v, 1)) < (H ‘if(v ∈ ℕ, v, 1)) → (G ‘(if(v ∈ ℕ, v, 1) + 1)) < (H ‘(if(v ∈ ℕ, v, 1) + 1)))
5047, 49dedth 1784 . . 3 (v ∈ ℕ → ((Gv) < (Hv) → (G ‘(v + 1)) < (H ‘(v + 1))))
514, 7, 10, 13, 39, 50nnind 4434 . 2 (A ∈ ℕ → (GA) < (HA))
521, 51ax-mp 6 1 (GA) < (HA)
Colors of variables: wff set class
Syntax hints:   → wi 2   ∧ wa 196   = weq 797   = wceq 1091   ∈ wcel 1092   ∖ cdif 1484   ∪ cun 1485  ifcif 1776  {csn 1808  ⟨cop 1810   class class class wbr 2054   × cxp 2408   ↾ cres 2412   ∘ ccom 2414  –→wf 2418   ‘cfv 2422  (class class class)co 3001  {copab2 3002  1st c1st 3085  2nd c2nd 3086  ℝcr 4027  1c1 4029   + caddc 4031   · cmulc 4032   < clt 4033   / cdiv 4091  ℕcn 4093  2c2 4454  3c3 4455  seqcseq 4660
This theorem is referenced by:  ruclem26 4910  ruclem27 4911  ruclem32 4916
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-inf 1079
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-fv 2438  df-rdg 2970  df-opr 3003  df-oprab 3004  df-1st 3087  df-2nd 3088  df-1o 3104  df-oadd 3106  df-omul 3107  df-er 3200  df-ec 3202  df-qs 3205  df-ni 3794  df-pli 3795  df-mi 3796  df-lti 3797  df-plpq 3829  df-mpq 3830  df-enq 3831  df-nq 3832  df-plq 3833  df-mq 3834  df-rq 3835  df-ltq 3836  df-1q 3837  df-np 3880  df-1p 3881  df-plp 3882  df-mp 3883  df-ltp 3884  df-plpr 3958  df-mpr 3959  df-enr 3960  df-nr 3961  df-plr 3962  df-mr 3963  df-ltr 3964  df-0r 3965  df-1r 3966  df-m1r 3967  df-c 4034  df-0 4035  df-1 4036  df-r 4038  df-plus 4039  df-mul 4040  df-lt 4041  df-sub 4133  df-neg 4135  df-div 4216  df-le 4277  df-n 4423  df-2 4462  df-3 4463  df-n0 4535  df-z 4564  df-seq 4661
metamath.org