proposition: Lemma lin_injective S T s t: length S = length T -> lin S s = lin T t -> S = T /\ s = t.
proof: Proof. induction S in T |-*; destruct T; try discriminate; simplify in *; auto. intros; edestruct IHS. all: injection H as H; eauto. all: injection H0; intuition; subst; intuition. Qed.
imports: RelationClasses Morphisms List Lia Init.Nat Setoid Undecidability.HOU(calculus.calculus second_order.diophantine_equations systemunification nth_order_unification)