proposition: Lemma ascii_dec_bool_true_iff : forall s1 s2, (if ascii_dec s1 s2 then true else false) = true <-> s1 = s2.
proof: Proof. intros s1 s2; destruct (ascii_dec s1 s2); simpl; intuition; discriminate. Qed.
imports: Coq.Strings.String Coq.Strings.Ascii Coq.Arith.Arith Coq.ZArith.BinInt Coq.NArith.BinNat Coq.Bool.Bool Coq.Classes.Morphisms Fiat.Common.Coq__8_4__8_5__Compat