Metamath Proof Explorer


Theorem ruclem6

Description: Lemma for ruc . Domain and codomain of the interval sequence. (Contributed by Mario Carneiro, 28-May-2014)

Ref Expression
Hypotheses ruc.1 ⊢ φ → F : ℕ ⟶ ℝ
ruc.2 ⊢ φ → D = x ∈ ℝ 2 , y ∈ ℝ ⟼ ⦋ 1 st ⁡ x + 2 nd ⁡ x 2 / m⦌ if m < y 1 st ⁡ x m m + 2 nd ⁡ x 2 2 nd ⁡ x
ruc.4 ⊢ C = 0 0 1 ∪ F
ruc.5 ⊢ G = seq 0 D C
Assertion ruclem6 ⊢ φ → G : ℕ 0 ⟶ ℝ 2

Proof

Step Hyp Ref Expression
1 ruc.1 ⊢ φ → F : ℕ ⟶ ℝ
2 ruc.2 ⊢ φ → D = x ∈ ℝ 2 , y ∈ ℝ ⟼ ⦋ 1 st ⁡ x + 2 nd ⁡ x 2 / m⦌ if m < y 1 st ⁡ x m m + 2 nd ⁡ x 2 2 nd ⁡ x
3 ruc.4 ⊢ C = 0 0 1 ∪ F
4 ruc.5 ⊢ G = seq 0 D C
5 4 fveq1i ⊢ G ⁡ 0 = seq 0 D C ⁡ 0
6 0z ⊢ 0 ∈ ℤ
7 seq1 ⊢ 0 ∈ ℤ → seq 0 D C ⁡ 0 = C ⁡ 0
8 6 7 ax-mp ⊢ seq 0 D C ⁡ 0 = C ⁡ 0
9 5 8 eqtri ⊢ G ⁡ 0 = C ⁡ 0
10 1 2 3 4 ruclem4 ⊢ φ → G ⁡ 0 = 0 1
11 9 10 eqtr3id ⊢ φ → C ⁡ 0 = 0 1
12 0re ⊢ 0 ∈ ℝ
13 1re ⊢ 1 ∈ ℝ
14 opelxpi ⊢ 0 ∈ ℝ ∧ 1 ∈ ℝ → 0 1 ∈ ℝ 2
15 12 13 14 mp2an ⊢ 0 1 ∈ ℝ 2
16 11 15 eqeltrdi ⊢ φ → C ⁡ 0 ∈ ℝ 2
17 1st2nd2 ⊢ z ∈ ℝ 2 → z = 1 st ⁡ z 2 nd ⁡ z
18 17 ad2antrl ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → z = 1 st ⁡ z 2 nd ⁡ z
19 18 oveq1d ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → z D w = 1 st ⁡ z 2 nd ⁡ z D w
20 1 adantr ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → F : ℕ ⟶ ℝ
21 2 adantr ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → D = x ∈ ℝ 2 , y ∈ ℝ ⟼ ⦋ 1 st ⁡ x + 2 nd ⁡ x 2 / m⦌ if m < y 1 st ⁡ x m m + 2 nd ⁡ x 2 2 nd ⁡ x
22 xp1st ⊢ z ∈ ℝ 2 → 1 st ⁡ z ∈ ℝ
23 22 ad2antrl ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → 1 st ⁡ z ∈ ℝ
24 xp2nd ⊢ z ∈ ℝ 2 → 2 nd ⁡ z ∈ ℝ
25 24 ad2antrl ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → 2 nd ⁡ z ∈ ℝ
26 simprr ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → w ∈ ℝ
27 eqid ⊢ 1 st ⁡ 1 st ⁡ z 2 nd ⁡ z D w = 1 st ⁡ 1 st ⁡ z 2 nd ⁡ z D w
28 eqid ⊢ 2 nd ⁡ 1 st ⁡ z 2 nd ⁡ z D w = 2 nd ⁡ 1 st ⁡ z 2 nd ⁡ z D w
29 20 21 23 25 26 27 28 ruclem1 ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → 1 st ⁡ z 2 nd ⁡ z D w ∈ ℝ 2 ∧ 1 st ⁡ 1 st ⁡ z 2 nd ⁡ z D w = if 1 st ⁡ z + 2 nd ⁡ z 2 < w 1 st ⁡ z 1 st ⁡ z + 2 nd ⁡ z 2 + 2 nd ⁡ z 2 ∧ 2 nd ⁡ 1 st ⁡ z 2 nd ⁡ z D w = if 1 st ⁡ z + 2 nd ⁡ z 2 < w 1 st ⁡ z + 2 nd ⁡ z 2 2 nd ⁡ z
30 29 simp1d ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → 1 st ⁡ z 2 nd ⁡ z D w ∈ ℝ 2
31 19 30 eqeltrd ⊢ φ ∧ z ∈ ℝ 2 ∧ w ∈ ℝ → z D w ∈ ℝ 2
32 nn0uz ⊢ ℕ 0 = ℤ ≥ 0
33 0zd ⊢ φ → 0 ∈ ℤ
34 0p1e1 ⊢ 0 + 1 = 1
35 34 fveq2i ⊢ ℤ ≥ 0 + 1 = ℤ ≥ 1
36 nnuz ⊢ ℕ = ℤ ≥ 1
37 35 36 eqtr4i ⊢ ℤ ≥ 0 + 1 = ℕ
38 37 eleq2i ⊢ z ∈ ℤ ≥ 0 + 1 ↔ z ∈ ℕ
39 3 equncomi ⊢ C = F ∪ 0 0 1
40 39 fveq1i ⊢ C ⁡ z = F ∪ 0 0 1 ⁡ z
41 nnne0 ⊢ z ∈ ℕ → z ≠ 0
42 41 necomd ⊢ z ∈ ℕ → 0 ≠ z
43 fvunsn ⊢ 0 ≠ z → F ∪ 0 0 1 ⁡ z = F ⁡ z
44 42 43 syl ⊢ z ∈ ℕ → F ∪ 0 0 1 ⁡ z = F ⁡ z
45 40 44 eqtrid ⊢ z ∈ ℕ → C ⁡ z = F ⁡ z
46 45 adantl ⊢ φ ∧ z ∈ ℕ → C ⁡ z = F ⁡ z
47 1 ffvelcdmda ⊢ φ ∧ z ∈ ℕ → F ⁡ z ∈ ℝ
48 46 47 eqeltrd ⊢ φ ∧ z ∈ ℕ → C ⁡ z ∈ ℝ
49 38 48 sylan2b ⊢ φ ∧ z ∈ ℤ ≥ 0 + 1 → C ⁡ z ∈ ℝ
50 16 31 32 33 49 seqf2 ⊢ φ → seq 0 D C : ℕ 0 ⟶ ℝ 2
51 4 feq1i ⊢ G : ℕ 0 ⟶ ℝ 2 ↔ seq 0 D C : ℕ 0 ⟶ ℝ 2
52 50 51 sylibr ⊢ φ → G : ℕ 0 ⟶ ℝ 2