Step
*
2
of Lemma
rprod_wf
1. ∀d:ℕ. ∀[n:ℤ]. ∀[x:{n..(n + d) + 1-} ⟶ ℝ]. (rprod(n;n + d;k.x[k]) ∈ ℝ)
⊢ ∀[n,m:ℤ]. ∀[x:{n..m + 1-} ⟶ ℝ]. (rprod(n;m;k.x[k]) ∈ ℝ)
BY
{ (Auto THEN (Decide ⌜n ≤ m⌝⋅ THENA Auto)) }
1
1. ∀d:ℕ. ∀[n:ℤ]. ∀[x:{n..(n + d) + 1-} ⟶ ℝ]. (rprod(n;n + d;k.x[k]) ∈ ℝ)
2. n : ℤ
3. m : ℤ
4. x : {n..m + 1-} ⟶ ℝ
5. n ≤ m
⊢ rprod(n;m;k.x[k]) ∈ ℝ
2
1. ∀d:ℕ. ∀[n:ℤ]. ∀[x:{n..(n + d) + 1-} ⟶ ℝ]. (rprod(n;n + d;k.x[k]) ∈ ℝ)
2. n : ℤ
3. m : ℤ
4. x : {n..m + 1-} ⟶ ℝ
5. ¬(n ≤ m)
⊢ rprod(n;m;k.x[k]) ∈ ℝ
Latex:
Latex:
1. \mforall{}d:\mBbbN{}. \mforall{}[n:\mBbbZ{}]. \mforall{}[x:\{n..(n + d) + 1\msupminus{}\} {}\mrightarrow{} \mBbbR{}]. (rprod(n;n + d;k.x[k]) \mmember{} \mBbbR{})
\mvdash{} \mforall{}[n,m:\mBbbZ{}]. \mforall{}[x:\{n..m + 1\msupminus{}\} {}\mrightarrow{} \mBbbR{}]. (rprod(n;m;k.x[k]) \mmember{} \mBbbR{})
By
Latex:
(Auto THEN (Decide \mkleeneopen{}n \mleq{} m\mkleeneclose{}\mcdot{} THENA Auto))
Home
Index