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

Theorem ruclem6 15008
 Description: Lemma for ruc 15016. Domain and range of the interval sequence. (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
ruclem6 (𝜑𝐺:ℕ0⟶(ℝ × ℝ))
Distinct variable groups:   𝑥,𝑚,𝑦,𝐹   𝑚,𝐺,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑚)   𝐶(𝑥,𝑦,𝑚)   𝐷(𝑥,𝑦,𝑚)

Proof of Theorem ruclem6
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ruc.5 . . . . . . 7 𝐺 = seq0(𝐷, 𝐶)
21fveq1i 6230 . . . . . 6 (𝐺‘0) = (seq0(𝐷, 𝐶)‘0)
3 0z 11426 . . . . . . 7 0 ∈ ℤ
4 seq1 12854 . . . . . . 7 (0 ∈ ℤ → (seq0(𝐷, 𝐶)‘0) = (𝐶‘0))
53, 4ax-mp 5 . . . . . 6 (seq0(𝐷, 𝐶)‘0) = (𝐶‘0)
62, 5eqtri 2673 . . . . 5 (𝐺‘0) = (𝐶‘0)
7 ruc.1 . . . . . 6 (𝜑𝐹:ℕ⟶ℝ)
8 ruc.2 . . . . . 6 (𝜑𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ (((1st𝑥) + (2nd𝑥)) / 2) / 𝑚if(𝑚 < 𝑦, ⟨(1st𝑥), 𝑚⟩, ⟨((𝑚 + (2nd𝑥)) / 2), (2nd𝑥)⟩)))
9 ruc.4 . . . . . 6 𝐶 = ({⟨0, ⟨0, 1⟩⟩} ∪ 𝐹)
107, 8, 9, 1ruclem4 15007 . . . . 5 (𝜑 → (𝐺‘0) = ⟨0, 1⟩)
116, 10syl5eqr 2699 . . . 4 (𝜑 → (𝐶‘0) = ⟨0, 1⟩)
12 0re 10078 . . . . 5 0 ∈ ℝ
13 1re 10077 . . . . 5 1 ∈ ℝ
14 opelxpi 5182 . . . . 5 ((0 ∈ ℝ ∧ 1 ∈ ℝ) → ⟨0, 1⟩ ∈ (ℝ × ℝ))
1512, 13, 14mp2an 708 . . . 4 ⟨0, 1⟩ ∈ (ℝ × ℝ)
1611, 15syl6eqel 2738 . . 3 (𝜑 → (𝐶‘0) ∈ (ℝ × ℝ))
17 1st2nd2 7249 . . . . . 6 (𝑧 ∈ (ℝ × ℝ) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
1817ad2antrl 764 . . . . 5 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
1918oveq1d 6705 . . . 4 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → (𝑧𝐷𝑤) = (⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤))
207adantr 480 . . . . . 6 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → 𝐹:ℕ⟶ℝ)
218adantr 480 . . . . . 6 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ (((1st𝑥) + (2nd𝑥)) / 2) / 𝑚if(𝑚 < 𝑦, ⟨(1st𝑥), 𝑚⟩, ⟨((𝑚 + (2nd𝑥)) / 2), (2nd𝑥)⟩)))
22 xp1st 7242 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → (1st𝑧) ∈ ℝ)
2322ad2antrl 764 . . . . . 6 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → (1st𝑧) ∈ ℝ)
24 xp2nd 7243 . . . . . . 7 (𝑧 ∈ (ℝ × ℝ) → (2nd𝑧) ∈ ℝ)
2524ad2antrl 764 . . . . . 6 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → (2nd𝑧) ∈ ℝ)
26 simprr 811 . . . . . 6 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → 𝑤 ∈ ℝ)
27 eqid 2651 . . . . . 6 (1st ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤)) = (1st ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤))
28 eqid 2651 . . . . . 6 (2nd ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤)) = (2nd ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤))
2920, 21, 23, 25, 26, 27, 28ruclem1 15004 . . . . 5 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → ((⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤) ∈ (ℝ × ℝ) ∧ (1st ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤)) = if((((1st𝑧) + (2nd𝑧)) / 2) < 𝑤, (1st𝑧), (((((1st𝑧) + (2nd𝑧)) / 2) + (2nd𝑧)) / 2)) ∧ (2nd ‘(⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤)) = if((((1st𝑧) + (2nd𝑧)) / 2) < 𝑤, (((1st𝑧) + (2nd𝑧)) / 2), (2nd𝑧))))
3029simp1d 1093 . . . 4 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → (⟨(1st𝑧), (2nd𝑧)⟩𝐷𝑤) ∈ (ℝ × ℝ))
3119, 30eqeltrd 2730 . . 3 ((𝜑 ∧ (𝑧 ∈ (ℝ × ℝ) ∧ 𝑤 ∈ ℝ)) → (𝑧𝐷𝑤) ∈ (ℝ × ℝ))
32 nn0uz 11760 . . 3 0 = (ℤ‘0)
33 0zd 11427 . . 3 (𝜑 → 0 ∈ ℤ)
34 0p1e1 11170 . . . . . . 7 (0 + 1) = 1
3534fveq2i 6232 . . . . . 6 (ℤ‘(0 + 1)) = (ℤ‘1)
36 nnuz 11761 . . . . . 6 ℕ = (ℤ‘1)
3735, 36eqtr4i 2676 . . . . 5 (ℤ‘(0 + 1)) = ℕ
3837eleq2i 2722 . . . 4 (𝑧 ∈ (ℤ‘(0 + 1)) ↔ 𝑧 ∈ ℕ)
399equncomi 3792 . . . . . . . 8 𝐶 = (𝐹 ∪ {⟨0, ⟨0, 1⟩⟩})
4039fveq1i 6230 . . . . . . 7 (𝐶𝑧) = ((𝐹 ∪ {⟨0, ⟨0, 1⟩⟩})‘𝑧)
41 nnne0 11091 . . . . . . . . 9 (𝑧 ∈ ℕ → 𝑧 ≠ 0)
4241necomd 2878 . . . . . . . 8 (𝑧 ∈ ℕ → 0 ≠ 𝑧)
43 fvunsn 6486 . . . . . . . 8 (0 ≠ 𝑧 → ((𝐹 ∪ {⟨0, ⟨0, 1⟩⟩})‘𝑧) = (𝐹𝑧))
4442, 43syl 17 . . . . . . 7 (𝑧 ∈ ℕ → ((𝐹 ∪ {⟨0, ⟨0, 1⟩⟩})‘𝑧) = (𝐹𝑧))
4540, 44syl5eq 2697 . . . . . 6 (𝑧 ∈ ℕ → (𝐶𝑧) = (𝐹𝑧))
4645adantl 481 . . . . 5 ((𝜑𝑧 ∈ ℕ) → (𝐶𝑧) = (𝐹𝑧))
477ffvelrnda 6399 . . . . 5 ((𝜑𝑧 ∈ ℕ) → (𝐹𝑧) ∈ ℝ)
4846, 47eqeltrd 2730 . . . 4 ((𝜑𝑧 ∈ ℕ) → (𝐶𝑧) ∈ ℝ)
4938, 48sylan2b 491 . . 3 ((𝜑𝑧 ∈ (ℤ‘(0 + 1))) → (𝐶𝑧) ∈ ℝ)
5016, 31, 32, 33, 49seqf2 12860 . 2 (𝜑 → seq0(𝐷, 𝐶):ℕ0⟶(ℝ × ℝ))
511feq1i 6074 . 2 (𝐺:ℕ0⟶(ℝ × ℝ) ↔ seq0(𝐷, 𝐶):ℕ0⟶(ℝ × ℝ))
5250, 51sylibr 224 1 (𝜑𝐺:ℕ0⟶(ℝ × ℝ))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1523   ∈ wcel 2030   ≠ wne 2823  ⦋csb 3566   ∪ cun 3605  ifcif 4119  {csn 4210  ⟨cop 4216   class class class wbr 4685   × cxp 5141  ⟶wf 5922  ‘cfv 5926  (class class class)co 6690   ↦ cmpt2 6692  1st c1st 7208  2nd c2nd 7209  ℝcr 9973  0cc0 9974  1c1 9975   + caddc 9977   < clt 10112   / cdiv 10722  ℕcn 11058  2c2 11108  ℕ0cn0 11330  ℤcz 11415  ℤ≥cuz 11725  seqcseq 12841 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-n0 11331  df-z 11416  df-uz 11726  df-fz 12365  df-seq 12842 This theorem is referenced by:  ruclem8  15010  ruclem9  15011  ruclem10  15012  ruclem11  15013  ruclem12  15014
 Copyright terms: Public domain W3C validator