blob: 0dfb1f4e35333a4270ebeaaf4462eb2b4ea7ff10 (
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
|
(***********************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA-Rocquencourt & LRI-CNRS-Orsay *)
(* \VV/ *************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(***********************************************************************)
(* $Id$ *)
(* Instantiation of the Ring tactic for the naturals of Arith $*)
Require Export Ring.
Require Export Arith.
Require Eqdep_dec.
Fixpoint nateq [n,m:nat] : bool :=
Cases n m of
| O O => true
| (S n') (S m') => (nateq n' m')
| _ _ => false
end.
Lemma nateq_prop : (n,m:nat)(Is_true (nateq n m))->n==m.
Proof.
Induction n; Induction m; Intros; Try Contradiction.
Trivial.
Unfold Is_true in H1.
Rewrite (H n1 H1).
Trivial.
Save.
Hints Resolve nateq_prop eq2eqT : arithring.
Definition NatTheory : (Semi_Ring_Theory plus mult (1) (0) nateq).
Split; Intros; Auto with arith arithring.
Apply eq2eqT; Apply simpl_plus_l with n.
Apply eqT2eq; Trivial.
Defined.
Add Semi Ring nat plus mult (1) (0) nateq NatTheory [O S].
Goal (n:nat)(S n)=(plus (S O) n).
Intro; Reflexivity.
Save S_to_plus_one.
Tactic Definition NatRing := (Repeat Rewrite S_to_plus_one); Ring.
|