proposition: Lemma L1 : alpha = zero -> P beta.
proof: Proof. intro; subst; unfold P; intros;rewrite mult_0_a; split. - auto with T1. - now destruct 1. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)