Step
*
1
1
2
1
of Lemma
odd-l_sum
1. T : Type
2. L : T List
3. f : {x:T| (x ∈ L)} ⟶ ℤ
4. l_sum(map(f;L)) = Σ(f L[i] | i < ||L||) ∈ ℤ
5. I : ℕ||L|| List
6. upto(||L||) = I ∈ (ℕ||L|| List)
7. ∀x:ℤ. ((x ∈ I) ∈ Type)
8. i : ℤ
9. (i ∈ I)
⊢ 0 ≤ i
BY
{ ((RepeatFor 2 (D -1) THEN HypSubst' (-1) 0) THEN GenConclAtAddr [2] THEN Auto) }
Latex:
Latex:
1. T : Type
2. L : T List
3. f : \{x:T| (x \mmember{} L)\} {}\mrightarrow{} \mBbbZ{}
4. l\_sum(map(f;L)) = \mSigma{}(f L[i] | i < ||L||)
5. I : \mBbbN{}||L|| List
6. upto(||L||) = I
7. \mforall{}x:\mBbbZ{}. ((x \mmember{} I) \mmember{} Type)
8. i : \mBbbZ{}
9. (i \mmember{} I)
\mvdash{} 0 \mleq{} i
By
Latex:
((RepeatFor 2 (D -1) THEN HypSubst' (-1) 0) THEN GenConclAtAddr [2] THEN Auto)
Home
Index