---

Step * of Lemma ctt-term-type-is-implies

No Annotations
∀[X:⊢''']. ∀[t:cttTerm(X)]. ∀[T:{X ⊢''' _}].  term(t) ∈ {X ⊢ _:T} supposing type(t)=T
BY
{ (Intros
   THEN Unfold `ctt-term-type-is` -1
   THEN (Enough to prove {X ⊢ _:T} = {X ⊢ _:type(t)} ∈ 𝕌{i''''}
          Because Auto)
   THEN GeneralizeEq (-1)
   THEN Auto) }

---

Latex:

---

Latex:
No  Annotations
\mforall{}[X:\mvdash{}'''].  \mforall{}[t:cttTerm(X)].  \mforall{}[T:\{X  \mvdash{}'''  \_\}].    term(t)  \mmember{}  \{X  \mvdash{}  \_:T\}  supposing  type(t)=T


By

---

Latex:
(Intros
  THEN  Unfold  `ctt-term-type-is`  -1
  THEN  (Enough  to  prove  \{X  \mvdash{}  \_:T\}  =  \{X  \mvdash{}  \_:type(t)\}
                Because  Auto)
  THEN  GeneralizeEq  (-1)
  THEN  Auto)

---

Home Index