blob: 66ee4eb090684568af00d97c01a504052bf72a52 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2010 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
(*i $Id: DiscrR.v 13323 2010-07-24 15:57:30Z herbelin $ i*)
Require Import RIneq.
Require Import Omega.
Open Local Scope R_scope.
Lemma Rlt_R0_R2 : 0 < 2.
change 2 with (INR 2); apply lt_INR_0; apply lt_O_Sn.
Qed.
Notation Rplus_lt_pos := Rplus_lt_0_compat (only parsing).
Lemma IZR_eq : forall z1 z2:Z, z1 = z2 -> IZR z1 = IZR z2.
intros; rewrite H; reflexivity.
Qed.
Lemma IZR_neq : forall z1 z2:Z, z1 <> z2 -> IZR z1 <> IZR z2.
intros; red in |- *; intro; elim H; apply eq_IZR; assumption.
Qed.
Ltac discrR :=
try
match goal with
| |- (?X1 <> ?X2) =>
change 2 with (IZR 2);
change 1 with (IZR 1);
change 0 with (IZR 0);
repeat
rewrite <- plus_IZR ||
rewrite <- mult_IZR ||
rewrite <- Ropp_Ropp_IZR || rewrite Z_R_minus;
apply IZR_neq; try discriminate
end.
Ltac prove_sup0 :=
match goal with
| |- (0 < 1) => apply Rlt_0_1
| |- (0 < ?X1) =>
repeat
(apply Rmult_lt_0_compat || apply Rplus_lt_pos;
try apply Rlt_0_1 || apply Rlt_R0_R2)
| |- (?X1 > 0) => change (0 < X1) in |- *; prove_sup0
end.
Ltac omega_sup :=
change 2 with (IZR 2);
change 1 with (IZR 1);
change 0 with (IZR 0);
repeat
rewrite <- plus_IZR ||
rewrite <- mult_IZR || rewrite <- Ropp_Ropp_IZR || rewrite Z_R_minus;
apply IZR_lt; omega.
Ltac prove_sup :=
match goal with
| |- (?X1 > ?X2) => change (X2 < X1) in |- *; prove_sup
| |- (0 < ?X1) => prove_sup0
| |- (- ?X1 < 0) => rewrite <- Ropp_0; prove_sup
| |- (- ?X1 < - ?X2) => apply Ropp_lt_gt_contravar; prove_sup
| |- (- ?X1 < ?X2) => apply Rlt_trans with 0; prove_sup
| |- (?X1 < ?X2) => omega_sup
| _ => idtac
end.
Ltac Rcompute :=
change 2 with (IZR 2);
change 1 with (IZR 1);
change 0 with (IZR 0);
repeat
rewrite <- plus_IZR ||
rewrite <- mult_IZR || rewrite <- Ropp_Ropp_IZR || rewrite Z_R_minus;
apply IZR_eq; try reflexivity.
|
