proposition: Lemma le_lteq p q : p ≤ q ↔ p < q ∨ p = q.
proof: Proof. rewrite to_Qc_inj_lt, to_Qc_inj_le, <-Qp.to_Qc_inj_iff. split. - intros [?| ->]%Qcle_lt_or_eq; auto. - intros [?| ->]; auto using Qclt_le_weak. Qed.
imports: Coq(QArith Qcanon) stdpp(well_founded) stdpp(options)