1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* This file was automatically generated: do not edit *********************)
19 (*#***********************************************************************)
21 (* v * The Coq Proof Assistant / The Coq Development Team *)
23 (* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
25 (* \VV/ **************************************************************)
27 (* // * This file is distributed under the terms of the *)
29 (* * GNU Lesser General Public License Version 2.1 *)
31 (*#***********************************************************************)
33 (*i $Id: auxiliary.v,v 1.12.2.1 2004/07/16 19:31:22 herbelin Exp $ i*)
35 (*#* Binary Integers (Pierre Cr\233\gut, CNET, Lannion, France) *)
37 include "Arith/Arith.ma".
39 include "ZArith/BinInt.ma".
41 include "ZArith/Zorder.ma".
43 include "Logic/Decidable.ma".
45 include "Arith/Peano_dec.ma".
47 include "Arith/Compare_dec.ma".
50 Open Local Scope Z_scope.
53 (*#*********************************************************************)
55 (*#* Moving terms from one side to the other of an inequality *)
57 inline procedural "cic:/Coq/ZArith/auxiliary/Zne_left.con" as theorem.
59 inline procedural "cic:/Coq/ZArith/auxiliary/Zegal_left.con" as theorem.
61 inline procedural "cic:/Coq/ZArith/auxiliary/Zle_left.con" as theorem.
63 inline procedural "cic:/Coq/ZArith/auxiliary/Zle_left_rev.con" as theorem.
65 inline procedural "cic:/Coq/ZArith/auxiliary/Zlt_left_rev.con" as theorem.
67 inline procedural "cic:/Coq/ZArith/auxiliary/Zlt_left.con" as theorem.
69 inline procedural "cic:/Coq/ZArith/auxiliary/Zlt_left_lt.con" as theorem.
71 inline procedural "cic:/Coq/ZArith/auxiliary/Zge_left.con" as theorem.
73 inline procedural "cic:/Coq/ZArith/auxiliary/Zgt_left.con" as theorem.
75 inline procedural "cic:/Coq/ZArith/auxiliary/Zgt_left_gt.con" as theorem.
77 inline procedural "cic:/Coq/ZArith/auxiliary/Zgt_left_rev.con" as theorem.
79 (*#*********************************************************************)
81 (*#* Factorization lemmas *)
83 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor0.con" as theorem.
85 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor1.con" as theorem.
87 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor2.con" as theorem.
89 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor3.con" as theorem.
91 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor4.con" as theorem.
93 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor5.con" as theorem.
95 inline procedural "cic:/Coq/ZArith/auxiliary/Zred_factor6.con" as theorem.
97 inline procedural "cic:/Coq/ZArith/auxiliary/Zle_mult_approx.con" as theorem.
99 inline procedural "cic:/Coq/ZArith/auxiliary/Zmult_le_approx.con" as theorem.