---

Step * of Lemma quotient_wf

∀[T:Type]. ∀[E:T ⟶ T ⟶ ℙ].  x,y:T//E[x;y] ∈ Type supposing EquivRel(T;x,y.E[x;y])
BY
{ ((UnivCD THENA Auto) THEN PerEqCD ⋅ THEN All Reduce THEN Auto THEN UseTrans ⌜y⌝⋅) }

---

Latex:

---

Latex:
\mforall{}[T:Type].  \mforall{}[E:T  {}\mrightarrow{}  T  {}\mrightarrow{}  \mBbbP{}].    x,y:T//E[x;y]  \mmember{}  Type  supposing  EquivRel(T;x,y.E[x;y])


By

---

Latex:
((UnivCD  THENA  Auto)  THEN  PerEqCD  \mcdot{}  THEN  All  Reduce  THEN  Auto  THEN  UseTrans  \mkleeneopen{}y\mkleeneclose{}\mcdot{})

---

Home Index