---

Step * of Lemma ml-prodmap_wf

∀[T,A,B:Type].
  ∀[f:A ⟶ B ⟶ T]. ∀[as:A List]. ∀[bs:B List].  (ml-prodmap(f;as;bs) ∈ T List) 
  supposing valueall-type(T) ∧ valueall-type(A) ∧ valueall-type(B) ∧ A ∧ B
BY
{ (Auto THEN RWO "ml-prodmap-sq" 0 THEN EAuto 1) }

---

Latex:

---

Latex:
\mforall{}[T,A,B:Type].
    \mforall{}[f:A  {}\mrightarrow{}  B  {}\mrightarrow{}  T].  \mforall{}[as:A  List].  \mforall{}[bs:B  List].    (ml-prodmap(f;as;bs)  \mmember{}  T  List) 
    supposing  valueall-type(T)  \mwedge{}  valueall-type(A)  \mwedge{}  valueall-type(B)  \mwedge{}  A  \mwedge{}  B


By

---

Latex:
(Auto  THEN  RWO  "ml-prodmap-sq"  0  THEN  EAuto  1)

---

Home Index