Step
*
1
1
1
1
of Lemma
rleq-rmax
1. x : ℕ+ ⟶ ℤ
2. [%2] : regular-seq(x)
3. y : ℕ+ ⟶ ℤ
4. [%4] : regular-seq(y)
5. n : ℕ+
6. m : ℕ+
7. (4 * n) = m ∈ ℕ+
8. (x m) ≤ imax(x m;y m)
⊢ (-2) ≤ ((reg-seq-list-add([λn.imax(x n;y n); λn.(-(x n))]) m) ÷ 4)
BY
{ ((RWO "reg-seq-list-add-as-l_sum" 0 THENA Auto) THEN Reduce 0) }
1
1. x : ℕ+ ⟶ ℤ
2. [%2] : regular-seq(x)
3. y : ℕ+ ⟶ ℤ
4. [%4] : regular-seq(y)
5. n : ℕ+
6. m : ℕ+
7. (4 * n) = m ∈ ℕ+
8. (x m) ≤ imax(x m;y m)
⊢ (-2) ≤ ((imax(x m;y m) + (-(x m)) + 0) ÷ 4)
Latex:
Latex:
1. x : \mBbbN{}\msupplus{} {}\mrightarrow{} \mBbbZ{}
2. [\%2] : regular-seq(x)
3. y : \mBbbN{}\msupplus{} {}\mrightarrow{} \mBbbZ{}
4. [\%4] : regular-seq(y)
5. n : \mBbbN{}\msupplus{}
6. m : \mBbbN{}\msupplus{}
7. (4 * n) = m
8. (x m) \mleq{} imax(x m;y m)
\mvdash{} (-2) \mleq{} ((reg-seq-list-add([\mlambda{}n.imax(x n;y n); \mlambda{}n.(-(x n))]) m) \mdiv{} 4)
By
Latex:
((RWO "reg-seq-list-add-as-l\_sum" 0 THENA Auto) THEN Reduce 0)
Home
Index