---

Step * of Lemma name_eq-is-inl

∀[x,y,z:Base].  x ~ y supposing name_eq(x;y) ~ inl z
BY
{ (((UnivCD THENA Auto) THEN RepUR ``name_eq`` -1)
   THEN InstLemma `sq-decider-name-deq` []
   THEN Unfold `sq-decider` -1
   THEN BHyp -1 
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[x,y,z:Base].    x  \msim{}  y  supposing  name\_eq(x;y)  \msim{}  inl  z


By

---

Latex:
(((UnivCD  THENA  Auto)  THEN  RepUR  ``name\_eq``  -1)
  THEN  InstLemma  `sq-decider-name-deq`  []
  THEN  Unfold  `sq-decider`  -1
  THEN  BHyp  -1 
  THEN  Auto)

---

Home Index