proposition: Theorem leb_total : forall a1 a2, a1 <=? a2 \/ a2 <=? a1.
proof: Proof. intros; setoid_rewrite Pos.leb_le; lia. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.micromega.Lia Coq.PArith.BinPos Coq.Lists.List Coq.Sorting.Mergesort Coq.Structures.OrdersEx Coq.Strings.Ascii Coq.Strings.String Fiat.Parsers.ContextFreeGrammar.Core Fiat.Parsers.ContextFreeGrammar.Carriers Fiat.Parsers.ContextFreeGrammar.Reflective Fiat.Parsers.ContextFreeGrammar.PreNotations Fiat.Parsers.Refinement.PossibleTerminalsSets