---

Step * 1 of Lemma subtype_imp-type

.....subterm..... T:t
1:n
1. A : Type
2. B : Type
3. x : B
⊢ x ∈ imp-type(A;B)
BY
{ (PointwiseFunctionalityForEquality (-1)
   THEN Auto
   THEN EqTypeCD
   THEN Auto
   THEN InstLemma `implies-least-equiv` [⌜Base⌝;⌜λx,y. ((x = y ∈ A) ⇒ (x = y ∈ B))⌝]⋅
   THEN Auto) }

---

Latex:

---

Latex:
.....subterm.....  T:t
1:n
1.  A  :  Type
2.  B  :  Type
3.  x  :  B
\mvdash{}  x  \mmember{}  imp-type(A;B)


By

---

Latex:
(PointwiseFunctionalityForEquality  (-1)
  THEN  Auto
  THEN  EqTypeCD
  THEN  Auto
  THEN  InstLemma  `implies-least-equiv`  [\mkleeneopen{}Base\mkleeneclose{};\mkleeneopen{}\mlambda{}x,y.  ((x  =  y)  {}\mRightarrow{}  (x  =  y))\mkleeneclose{}]\mcdot{}
  THEN  Auto)

---

Home Index