proposition: Lemma not_INR : forall n m:nat, n <> m -> INR n <> INR m.
proof: Proof. intros n m [Hlt | Hgt]%Nat.lt_gt_cases. - now apply Rlt_not_eq, lt_INR. - now apply not_eq_sym, Rlt_not_eq, lt_INR. Qed.
imports: RelationClasses Raxioms Rpow_def ZArith ZArithRing RealField