-
Notifications
You must be signed in to change notification settings - Fork 1
/
Zex.v
72 lines (63 loc) · 903 Bytes
/
Zex.v
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
Require Import ZArith.
Require Import PolTac.
Open Scope Z_scope.
Theorem pols_test1 x y :
x < y -> x + x < y + x.
Proof.
intros.
pols.
auto.
Qed.
Theorem pols_test2 x y :
y < 0 -> x + y < x.
Proof.
intros.
pols.
auto.
Qed.
Theorem pols_test3 x y :
0 < y * y ->
(x + y) * (x - y) < x * x.
Proof.
intros.
pols.
auto with zarith.
Qed.
Theorem pols_test4 x y :
x * x < y * y ->
(x + y) * (x + y) < 2 * (x * y + y * y).
Proof.
intros.
pols.
auto.
Qed.
Theorem pols_test5 x y z :
x + y * (y + z) = 2 * z ->
2 * x + y * (y + z) = (x + z) + z.
Proof.
intros.
pols.
auto.
Qed.
Theorem polf_test1 x y :
0 <= x -> 1 <= y -> x <= x * y.
Proof.
intros.
polf.
Qed.
Theorem polf_test2 x y :
0 < x -> x <= x * y -> 1 <= y.
Proof.
intros H1 H2.
hyp_polf H2.
Qed.
Theorem polr_test1 x y z :
x + z < y -> x + y + z < 2 * y.
Proof.
intros H.
polr H.
pols.
auto.
pols.
auto with zarith.
Qed.