---

Step * of Lemma es-or-latest_wf

∀[Info,A,B:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(B)].  ((X |- Y) ∈ EClass(one_or_both(A;B)))
BY
{ (Unfold `one_or_both` 0 THEN ProveWfLemma) }

---

Latex:

---

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[X:EClass(A)].  \mforall{}[Y:EClass(B)].    ((X  |\msupminus{}  Y)  \mmember{}  EClass(one\_or\_both(A;B)))


By

---

Latex:
(Unfold  `one\_or\_both`  0  THEN  ProveWfLemma)

---

Home Index