---

Step * of Lemma subtype_rel_wf

∀[A,B:Type].  (A ⊆r B ∈ Type)
BY
{ ((UnivCD THENA Auto) THEN Unfold `subtype_rel` 0 THEN InstLemma `equal-wf-base` [A ⟶ B;⌜λx.x⌝;⌜λx.x⌝]⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[A,B:Type].    (A  \msubseteq{}r  B  \mmember{}  Type)


By

---

Latex:
((UnivCD  THENA  Auto)
  THEN  Unfold  `subtype\_rel`  0
  THEN  InstLemma  `equal-wf-base`  [A  {}\mrightarrow{}  B;\mkleeneopen{}\mlambda{}x.x\mkleeneclose{};\mkleeneopen{}\mlambda{}x.x\mkleeneclose{}]\mcdot{}
  THEN  Auto)

---

Home Index