proposition: Lemma bool_eq_iff (b b':bool) : (b = b') <-> (b <-> b').
proof: Proof. split. - intro; subst; tauto. - case b; case b'; auto; destruct 1 as [H H0]. assert (false) by (now apply H); discriminate. assert (false) by (now apply H0); discriminate. 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)