---

Step * of Lemma radd-list-linearity2

∀[T:Type]. ∀[x:T ⟶ ℝ]. ∀[a:ℝ]. ∀[L:T List].  (radd-list(map(λk.(a * x[k]);L)) = (a * radd-list(map(λk.x[k];L))))
BY
{ (InductionOnList THEN Reduce 0 THEN (RWW "radd-list-cons -1" 0 THENA Auto) THEN slowRNorm 0 THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[x:T  {}\mrightarrow{}  \mBbbR{}].  \mforall{}[a:\mBbbR{}].  \mforall{}[L:T  List].
    (radd-list(map(\mlambda{}k.(a  *  x[k]);L))  =  (a  *  radd-list(map(\mlambda{}k.x[k];L))))


By

---

Latex:
(InductionOnList
  THEN  Reduce  0
  THEN  (RWW  "radd-list-cons  -1"  0  THENA  Auto)
  THEN  slowRNorm  0
  THEN  Auto)

---

Home Index