proposition: Lemma Red_type_preserving : forall M N, Red M N -> type M = type N.
proof: Proof. intros M N MN. induction MN; try solve [term_inv M; term_inv N]. apply R_type_preserving; trivial. Qed.
imports: CoLoR(RelExtras ListExtras TermsSubstConv)