proposition: Lemma repeated_typing Gamma S A: (forall s, s ∈ S -> Gamma ⊢ s : A) -> forall n, n = length S -> Gamma ⊢₊ S : repeat A n.
proof: Proof. induction S; cbn; intros; subst; cbn;eauto. intuition. Qed.
imports: List Arith Lia Morphisms FinFun Undecidability.HOU(std.std) Undecidability.HOU.calculus(prelim terms syntax semantics equivalence typing order confluence)