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
18 (Rlt (Rmult(Ropp x)R1)
26 (Rmult (Ropp (Rplus R1 R1)) x) (Rplus
27 (Rmult (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 R1)))) y) (Rplus
28 (Rmult (Rplus R1 (Rplus R1 R1)) z) R1)
33 (Rmult (Ropp (Rplus R1 (Rplus R1 R1))) x) (Rplus
34 (Rmult (Ropp (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 (Rplus R1 R1)))))) y) (Rplus
41 (Rmult (Rplus R1 R1) y) (Ropp z) )
46 (Rmult (Rplus R1 (Rplus R1 R1)) x) (Rplus
54 !x:R.!y:R.!z:R.!t:R.!u:R.!v:R.
56 (Rplus (Ropp x) (Rplus y (Rplus z (Rplus t (Rplus u (Rplus v (Rplus R1 R1)))))))
60 (Rplus x (Rplus (Ropp y) (Rplus (Ropp z) (Rplus (Ropp t) (Rplus (Ropp u) (Rplus R1 R1))))))
64 (Rplus y (Rplus (Ropp z) (Rplus t (Rplus u (Rplus R1 R1)))))
68 (Rplus y (Rplus z (Rplus (Ropp t) (Rplus (Ropp (Rmult (Rplus R1 R1)v)) (Rplus R1 R1)))))
72 (Rplus y (Rplus z (Rplus t (Rplus (Ropp u) (Rplus R1 R1)))))
76 (Rplus (Rmult (Rplus R1 R1) x) (Rplus v y))
78 -> (Rlt (Rmult (Rplus R1 R1) x) R0)
86 !x:R.!y:R.(Rle x y) -> (Rge (Rplus y R1) (Rminus x R1))
89 !x:R.!y:R.(Rlt x y) -> (Rgt (Rplus y R1) (Rminus x R1))
92 !x:R.!y:R.(Rge x y) -> (Rlt (Rplus y R1) (Rplus x (Rplus R1 R1)))
94 /Coq/fourier/Fourier_util/Rfourier_not_ge_lt.con
98 /Coq/Init/Logic/False.ind#1/1
100 (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))))
102 /Coq/fourier/Fourier_util/Rnot_le_le.con
104 t1=(Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))
106 t2=(Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x))
109 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))
110 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x)))
112 tc=(Rmult (Ropp R1) (Rinv R1))
114 rewrite=(eqT R (Rminus (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus y R1)) (Rmult (Rmult R1 (Rinv R1)) x))
115 (Rplus (Rmult (Rmult R1 (Rinv R1)) (Rplus x (Rplus R1 R1))) (Rmult (Rmult R1 (Rinv R1)) y))) (Rmult (Ropp R1) (Rinv R1)))
118 (Rlt R0 (Rmult (Ropp R1) (Rinv R1)))
119 (eqT R R0 (Rmult (Ropp R1) (Rinv R1)))
123 /Coq/fourier/Fourier_util/Rnot_lt0.con
126 !x:R.!y:R.(Rgt x y) -> (Rle (Rminus y R1) (Rplus x R1))
129 !x:R.!y:R.(Rlt x ( Rplus y R1 ) ) -> (Rge (Rplus y (Rplus R1 R1)) (Rminus x R0))
132 !x:R.!y:R.(eqT R x y) -> (Rgt (Rplus y R1) (Rminus x R1))
134 //test base7 (should fail) ok
135 !x:R.!y:R.(Rlt x y) -> (Rlt (Rplus y R1) (Rminus x R1))