---

Step * of Lemma rec-bind-class-arg_wf

∀[Info,A,B:Type]. ∀[X:A ⟶ EClass(B)]. ∀[Y:A ⟶ EClass(A)]. ∀[a:A].
  rec-bind-class-arg(X;Y;a) ∈ EClass(B) supposing not-self-starting{i:l}(Info;A;Y)
BY
{ ProveWfLemma }

---

Latex:

---

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[X:A  {}\mrightarrow{}  EClass(B)].  \mforall{}[Y:A  {}\mrightarrow{}  EClass(A)].  \mforall{}[a:A].
    rec-bind-class-arg(X;Y;a)  \mmember{}  EClass(B)  supposing  not-self-starting\{i:l\}(Info;A;Y)


By

---

Latex:
ProveWfLemma

---

Home Index