1 alias Rge /Coq/Reals/Rdefinitions/Rge.con
2 alias Rle /Coq/Reals/Rdefinitions/Rle.con
3 alias Rgt /Coq/Reals/Rdefinitions/Rgt.con
4 alias Rlt /Coq/Reals/Rdefinitions/Rlt.con
5 alias Ropp /Coq/Reals/Rdefinitions/Ropp.con
6 alias Rinv /Coq/Reals/Rdefinitions/Rinv.con
7 alias Rplus /Coq/Reals/Rdefinitions/Rplus.con
8 alias Rminus /Coq/Reals/Rdefinitions/Rminus.con
9 alias Rmult /Coq/Reals/Rdefinitions/Rmult.con
10 alias R1 /Coq/Reals/Rdefinitions/R1.con
11 alias R0 /Coq/Reals/Rdefinitions/R0.con
12 alias R /Coq/Reals/Rdefinitions/R.con
13 alias eqT /Coq/Init/Logic_Type/eqT.ind#1/1
14 alias not /Coq/Init/Logic/not.con
15 alias or /Coq/Init/Logic/or.ind#1/1
21 (Rmult (Ropp (Rplus R1 R1)) x) (Rplus
22 (Rmult (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 R1)))) y) (Rplus
23 (Rmult (Rplus R1 (Rplus R1 R1)) z) R1)
28 (Rmult (Ropp (Rplus R1 (Rplus R1 R1))) x) (Rplus
29 (Rmult (Ropp (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 R1)))))) y) (Rplus
36 (Rmult (Rplus R1 R1) y) (Ropp z) )
41 (Rmult (Rplus R1 (Rplus R1 R1)) x) (Rplus
48 !x:R.!y:R.(Rle x y) -> (Rge (Rplus y R1) (Rminus x R1))
51 !x:R.!y:R.(Rlt x y) -> (Rgt (Rplus y R1) (Rminus x R1))
54 !x:R.!y:R.(Rge x y) -> (Rlt (Rplus y R1) (Rplus x (Rplus R1 R1)))
56 /Coq/fourier/Fourier_util/Rfourier_not_ge_lt.con
60 /Coq/Init/Logic/False.ind#1/1
62 (not (Rle (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y)) (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x))))
64 /Coq/fourier/Fourier_util/Rnot_le_le.con
66 t1=(Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))
68 t2=(Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x))
71 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))
72 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x)))
74 tc=(Rmult (Ropp R1) (Rinv R1))
76 rewrite=(eqT R (Rminus (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x))
77 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))) (Rmult (Ropp R1) (Rinv R1)))
80 (Rlt R0 (Rmult (Ropp R1) (Rinv R1)))
81 (eqT R R0 (Rmult (Ropp R1) (Rinv R1)))
85 /Coq/fourier/Fourier_util/Rnot_lt0.con
88 !x:R.!y:R.(Rgt x y) -> (Rle (Rminus y R1) (Rplus x R1))
91 !x:R.!y:R.(Rlt x ( Rplus y R1 ) ) -> (Rge (Rplus y (Rplus R1 R1)) (Rminus x R0))
94 !x:R.!y:R.(eqT R x y) -> (Rgt (Rplus y R1) (Rminus x R1))
96 //test base7 (should fail) ok
97 !x:R.!y:R.(Rlt x y) -> (Rlt (Rplus y R1) (Rminus x R1))