---

Step * of Lemma outr_wf

∀[A,B:Type]. ∀[x:A + B].  outr(x) ∈ B supposing ↑¬bisl(x)
BY
{ (Auto THEN All Reduce THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].  \mforall{}[x:A  +  B].    outr(x)  \mmember{}  B  supposing  \muparrow{}\mneg{}\msubb{}isl(x)


By

---

Latex:
(Auto  THEN  All  Reduce  THEN  Auto)

---

Home Index