proposition: Lemma simplify_bool_expr a b (Himpl : is_true a -> is_true b) : (a || (b && negb a))%bool = b.
proof: Proof. destruct a, b; try reflexivity; simpl; symmetry; apply Himpl; reflexivity. Qed.
imports: Coq.Sets.Ensembles Fiat.Parsers.StringLike.Core Fiat.Parsers.StringLike.Properties Fiat.Parsers.ContextFreeGrammar.Fix.Properties Fiat.Parsers.ContextFreeGrammar.Fix.Prod Fiat.Parsers.ContextFreeGrammar.Fix.FromAbstractInterpretationDefinitions Fiat.Common Fiat.Common.Instances Fiat.Common.BoolFacts