---

Step * of Lemma member-eq-is-equiv

∀[A,B:Type].  EquivRel(A;x,y.(x ∈ B) = (y ∈ B) ∈ Type) supposing respects-equality(A;B)
BY
{ (((Auto THEN (InstLemma `equal-wf` [⌜A⌝;⌜A⌝;⌜B⌝]⋅ THENA Auto)) THEN D 0)
   THEN SplitAndConcl
   THEN (D 0 THEN Reduce 0)
   THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].    EquivRel(A;x,y.(x  \mmember{}  B)  =  (y  \mmember{}  B))  supposing  respects-equality(A;B)


By

---

Latex:
(((Auto  THEN  (InstLemma  `equal-wf`  [\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}B\mkleeneclose{}]\mcdot{}  THENA  Auto))  THEN  D  0)
  THEN  SplitAndConcl
  THEN  (D  0  THEN  Reduce  0)
  THEN  Auto)

---

Home Index