---

Step * of Lemma sqn+1type_product

∀[T,S:Type]. ∀[n:ℕ].  (sqntype(n + 1;T × S)) supposing (sqntype(n;S) and sqntype(n;T))
BY
{ (Auto THEN InstLemma `sqn+1type_dep_product` [⌜T⌝;⌜λ2t.S⌝;⌜n⌝]⋅ THEN Auto) }

---

Latex:

---

Latex:
\mforall{}[T,S:Type].  \mforall{}[n:\mBbbN{}].    (sqntype(n  +  1;T  \mtimes{}  S))  supposing  (sqntype(n;S)  and  sqntype(n;T))


By

---

Latex:
(Auto  THEN  InstLemma  `sqn+1type\_dep\_product`  [\mkleeneopen{}T\mkleeneclose{};\mkleeneopen{}\mlambda{}\msubtwo{}t.S\mkleeneclose{};\mkleeneopen{}n\mkleeneclose{}]\mcdot{}  THEN  Auto)

---

Home Index