proposition: Lemma less_plusOne : forall x : R, x [<] x[+][1].
proof: Proof. intros x. astepl ([0][+]x); astepr ([1][+]x). apply plus_resp_less_rht. exact pos_one. Qed.
imports: CoRN.tactics.FieldReflection CoRN.tactics.Rational CoRN.algebra.CSetoids Coq(Lia)