1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| A.Asperti, C.Sacerdoti Coen, *)
8 (* ||A|| E.Tassi, S.Zacchiroli *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU Lesser General Public License Version 2.1 *)
13 (**************************************************************************)
15 set "baseuri" "cic:/matita/nat/plus".
22 | (S p) \Rightarrow S (plus p m) ].
24 theorem plus_n_O: \forall n:nat. eq nat n (plus n O).
27 simplify.apply eq_f.assumption.
30 theorem plus_n_Sm : \forall n,m:nat. eq nat (S (plus n m)) (plus n (S m)).
33 simplify.apply eq_f.assumption.
36 (* some problem here: confusion between relations/symmetric
37 and functions/symmetric; functions symmetric is not in
39 theorem symmetric_plus: symmetric nat plus. *)
41 theorem sym_plus: \forall n,m:nat. eq nat (plus n m) (plus m n).
43 simplify.apply plus_n_O.
44 simplify.rewrite > H.apply plus_n_Sm.
47 theorem associative_plus : associative nat plus.
48 simplify.intros.elim x.
50 simplify.apply eq_f.assumption.
53 theorem assoc_plus : \forall n,m,p:nat. eq nat (plus (plus n m) p) (plus n (plus m p))
54 \def associative_plus.
56 theorem injective_plus_r: \forall n:nat.injective nat nat (\lambda m.plus n m).
57 intro.simplify.intros 2.elim n.
59 apply H.apply inj_S.apply H1.
62 theorem inj_plus_r: \forall p,n,m:nat.eq nat (plus p n) (plus p m) \to (eq nat n m)
63 \def injective_plus_r.
65 theorem injective_plus_l: \forall m:nat.injective nat nat (\lambda n.plus n m).
66 intro.simplify.intros.
67 (* qui vorrei applicare injective_plus_r *)
74 theorem inj_plus_l: \forall p,n,m:nat.eq nat (plus n p) (plus m p) \to (eq nat n m)
75 \def injective_plus_l.