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 (* include "higher_order_defs/functions.ma". *)
16 include "hints_declaration.ma".
17 include "basics/functions.ma".
18 include "basics/eq.ma".
20 ninductive nat : Type[0] ≝
24 interpretation "Natural numbers" 'N = nat.
26 alias num (instance 0) = "nnatural number".
30 {n:>nat; is_pos: n ≠ 0}.
32 ncoercion nat_to_pos: ∀n:nat. n ≠0 →pos ≝ mk_pos on
35 (* default "natural numbers" cic:/matita/ng/arithmetics/nat/nat.ind.
39 λn. match n with [ O ⇒ O | (S p) ⇒ p].
41 ntheorem pred_Sn : ∀n. n = pred (S n).
44 ntheorem injective_S : injective nat nat S.
48 ntheorem inj_S : \forall n,m:nat.(S n)=(S m) \to n=m.
51 ntheorem not_eq_S: ∀n,m:nat. n ≠ m → S n ≠ S m.
54 ndefinition not_zero: nat → Prop ≝
56 [ O ⇒ False | (S p) ⇒ True ].
58 ntheorem not_eq_O_S : ∀n:nat. O ≠ S n.
59 #n; #eqOS; nchange with (not_zero O); nrewrite > eqOS; //.
62 ntheorem not_eq_n_Sn : ∀n:nat. n ≠ S n.
63 #n; nelim n; /2/; nqed.
67 (n=O → P O) → (∀m:nat. (n=(S m) → P (S m))) → P n.
68 #n; #P; nelim n; /2/; nqed.
74 → (∀n,m:nat. R n m → R (S n) (S m))
76 #R; #ROn; #RSO; #RSS; #n; nelim n;//;
77 #n0; #Rn0m; #m; ncases m;/2/; nqed.
79 ntheorem decidable_eq_nat : ∀n,m:nat.decidable (n=m).
83 ##| #m; #Hind; ncases Hind; /3/;
87 (*************************** plus ******************************)
92 | S p ⇒ S (plus p m) ].
94 interpretation "natural plus" 'plus x y = (plus x y).
96 ntheorem plus_O_n: ∀n:nat. n = 0+n.
100 ntheorem plus_Sn_m: ∀n,m:nat. S (n + m) = S n + m.
104 ntheorem plus_n_O: ∀n:nat. n = n+0.
105 #n; nelim n; nnormalize; //; nqed.
107 ntheorem plus_n_Sm : ∀n,m:nat. S (n+m) = n + S m.
108 #n; nelim n; nnormalize; //; nqed.
111 ntheorem plus_Sn_m1: ∀n,m:nat. S m + n = n + S m.
112 #n; nelim n; nnormalize; //; nqed.
116 ntheorem plus_n_SO : ∀n:nat. S n = n+S O.
119 ntheorem symmetric_plus: symmetric ? plus.
120 #n; nelim n; nnormalize; //; nqed.
122 ntheorem associative_plus : associative nat plus.
123 #n; nelim n; nnormalize; //; nqed.
125 ntheorem assoc_plus1: ∀a,b,c. c + (b + a) = b + c + a.
128 ntheorem injective_plus_r: ∀n:nat.injective nat nat (λm.n+m).
129 #n; nelim n; nnormalize; /3/; nqed.
131 (* ntheorem inj_plus_r: \forall p,n,m:nat. p+n = p+m \to n=m
132 \def injective_plus_r.
134 ntheorem injective_plus_l: ∀m:nat.injective nat nat (λn.n+m).
137 (* ntheorem inj_plus_l: \forall p,n,m:nat. n+p = m+p \to n=m
138 \def injective_plus_l. *)
140 (*************************** times *****************************)
145 | S p ⇒ m+(times p m) ].
147 interpretation "natural times" 'times x y = (times x y).
149 ntheorem times_Sn_m: ∀n,m:nat. m+n*m = S n*m.
152 ntheorem times_O_n: ∀n:nat. O = O*n.
155 ntheorem times_n_O: ∀n:nat. O = n*O.
156 #n; nelim n; //; nqed.
158 ntheorem times_n_Sm : ∀n,m:nat. n+(n*m) = n*(S m).
159 #n; nelim n; nnormalize; //; nqed.
161 ntheorem symmetric_times : symmetric nat times.
162 #n; nelim n; nnormalize; //; nqed.
164 (* variant sym_times : \forall n,m:nat. n*m = m*n \def
167 ntheorem distributive_times_plus : distributive nat times plus.
168 #n; nelim n; nnormalize; //; nqed.
170 ntheorem distributive_times_plus_r:
171 \forall a,b,c:nat. (b+c)*a = b*a + c*a.
174 ntheorem associative_times: associative nat times.
175 #n; nelim n; nnormalize; //; nqed.
177 nlemma times_times: ∀x,y,z. x*(y*z) = y*(x*z).
180 (* ci servono questi risultati?
181 ntheorem times_O_to_O: ∀n,m:nat.n*m=O → n=O ∨ m=O.
182 napply nat_elim2; /2/;
183 #n; #m; #H; nnormalize; #H1; napply False_ind;napply not_eq_O_S;
186 ntheorem times_n_SO : ∀n:nat. n = n * S O.
189 ntheorem times_SSO_n : ∀n:nat. n + n = (S(S O)) * n.
190 nnormalize; //; nqed.
192 nlemma times_SSO: \forall n.(S(S O))*(S n) = S(S((S(S O))*n)).
195 ntheorem or_eq_eq_S: \forall n.\exists m.
196 n = (S(S O))*m \lor n = S ((S(S O))*m).
199 ##|#a; #H; nelim H; #b;#or;nelim or;#aeq;
201 ##|@ (S b); @ 1; /2/;
206 (******************** ordering relations ************************)
208 ninductive le (n:nat) : nat → Prop ≝
210 | le_S : ∀ m:nat. le n m → le n (S m).
212 interpretation "natural 'less or equal to'" 'leq x y = (le x y).
214 interpretation "natural 'neither less nor equal to'" 'nleq x y = (Not (le x y)).
216 ndefinition lt: nat → nat → Prop ≝
219 interpretation "natural 'less than'" 'lt x y = (lt x y).
221 interpretation "natural 'not less than'" 'nless x y = (Not (lt x y)).
223 (* nlemma eq_lt: ∀n,m. (n < m) = (S n ≤ m).
226 ndefinition ge: nat \to nat \to Prop \def
227 \lambda n,m:nat.m \leq n.
229 interpretation "natural 'greater or equal to'" 'geq x y = (ge x y).
231 ndefinition gt: nat \to nat \to Prop \def
234 interpretation "natural 'greater than'" 'gt x y = (gt x y).
236 interpretation "natural 'not greater than'" 'ngtr x y = (Not (gt x y)).
238 ntheorem transitive_le : transitive nat le.
239 #a; #b; #c; #leab; #lebc;nelim lebc;/2/;
243 ntheorem trans_le: \forall n,m,p:nat. n \leq m \to m \leq p \to n \leq p
244 \def transitive_le. *)
247 naxiom transitive_lt: transitive nat lt.
248 (* #a; #b; #c; #ltab; #ltbc;nelim ltbc;/2/;nqed.*)
251 theorem trans_lt: \forall n,m,p:nat. lt n m \to lt m p \to lt n p
252 \def transitive_lt. *)
254 ntheorem le_S_S: ∀n,m:nat. n ≤ m → S n ≤ S m.
255 #n; #m; #lenm; nelim lenm; /2/; nqed.
257 ntheorem le_O_n : ∀n:nat. O ≤ n.
258 #n; nelim n; /2/; nqed.
260 ntheorem le_n_Sn : ∀n:nat. n ≤ S n.
263 ntheorem le_pred_n : ∀n:nat. pred n ≤ n.
264 #n; nelim n; //; nqed.
266 (* XXX global problem *)
267 nlemma my_trans_le : ∀x,y,z:nat.x ≤ y → y ≤ z → x ≤ z.
268 napply transitive_le.
271 ntheorem monotonic_pred: monotonic ? le pred.
272 #n; #m; #lenm; nelim lenm; /2/; nqed.
274 ntheorem le_S_S_to_le: ∀n,m:nat. S n ≤ S m → n ≤ m.
275 (* XXX *) nletin hint ≝ monotonic. /2/; nqed.
277 ntheorem lt_S_S_to_lt: ∀n,m. S n < S m → n < m.
280 ntheorem lt_to_lt_S_S: ∀n,m. n < m → S n < S m.
283 ntheorem lt_to_not_zero : ∀n,m:nat. n < m → not_zero m.
284 #n; #m; #Hlt; nelim Hlt;//; nqed.
287 ntheorem not_le_Sn_O: ∀ n:nat. S n ≰ O.
288 #n; #Hlen0; napply (lt_to_not_zero ?? Hlen0); nqed.
290 ntheorem not_le_to_not_le_S_S: ∀ n,m:nat. n ≰ m → S n ≰ S m.
293 ntheorem not_le_S_S_to_not_le: ∀ n,m:nat. S n ≰ S m → n ≰ m.
296 naxiom decidable_le: ∀n,m. decidable (n≤m).
298 ntheorem decidable_le: ∀n,m. decidable (n≤m).
299 napply nat_elim2; #n; /3/;
300 #m; #dec; ncases dec;/4/; nqed. *)
302 ntheorem decidable_lt: ∀n,m. decidable (n < m).
303 #n; #m; napply decidable_le ; nqed.
305 ntheorem not_le_Sn_n: ∀n:nat. S n ≰ n.
306 #n; nelim n; /3/; nqed.
308 ntheorem lt_S_to_le: ∀n,m:nat. n < S m → n ≤ m.
311 ntheorem not_le_to_lt: ∀n,m. n ≰ m → m < n.
312 napply nat_elim2; #n;
313 ##[#abs; napply False_ind;/2/;
315 ##|#m;#Hind;#HnotleSS; napply lt_to_lt_S_S;/4/;
319 ntheorem lt_to_not_le: ∀n,m. n < m → m ≰ n.
320 #n; #m; #Hltnm; nelim Hltnm;/3/; nqed.
322 ntheorem not_lt_to_le: ∀n,m:nat. n ≮ m → m ≤ n.
323 #n; #m; #Hnlt; napply lt_S_to_le;
324 (* something strange here: /2/ fails:
325 we need an extra depths for unfolding not *)
326 napply not_le_to_lt; napply Hnlt; nqed.
328 ntheorem le_to_not_lt: ∀n,m:nat. n ≤ m → m ≮ n.
331 (* lt and le trans *)
333 ntheorem lt_to_le_to_lt: ∀n,m,p:nat. n < m → m ≤ p → n < p.
334 #n; #m; #p; #H; #H1; nelim H1; /2/; nqed.
336 ntheorem le_to_lt_to_lt: ∀n,m,p:nat. n ≤ m → m < p → n < p.
337 #n; #m; #p; #H; nelim H; /3/; nqed.
339 ntheorem lt_S_to_lt: ∀n,m. S n < m → n < m.
342 ntheorem ltn_to_ltO: ∀n,m:nat. n < m → O < m.
346 theorem lt_SO_n_to_lt_O_pred_n: \forall n:nat.
347 (S O) \lt n \to O \lt (pred n).
349 apply (ltn_to_ltO (pred (S O)) (pred n) ?).
350 apply (lt_pred (S O) n);
356 ntheorem lt_O_n_elim: ∀n:nat. O < n →
357 ∀P:nat → Prop.(∀m:nat.P (S m)) → P n.
358 #n; nelim n; //; #abs; napply False_ind; /2/; nqed.
361 theorem lt_pred: \forall n,m.
362 O < n \to n < m \to pred n < pred m.
364 [intros.apply False_ind.apply (not_le_Sn_O ? H)
365 |intros.apply False_ind.apply (not_le_Sn_O ? H1)
366 |intros.simplify.unfold.apply le_S_S_to_le.assumption
370 theorem S_pred: \forall n:nat.lt O n \to eq nat n (S (pred n)).
371 intro.elim n.apply False_ind.exact (not_le_Sn_O O H).
372 apply eq_f.apply pred_Sn.
375 theorem le_pred_to_le:
376 ∀n,m. O < m → pred n ≤ pred m → n ≤ m.
381 rewrite > (S_pred m);
392 ntheorem le_to_or_lt_eq: ∀n,m:nat. n ≤ m → n < m ∨ n = m.
393 #n; #m; #lenm; nelim lenm; /3/; nqed.
396 ntheorem lt_to_not_eq : ∀n,m:nat. n < m → n ≠ m.
400 ntheorem eq_to_not_lt: ∀a,b:nat. a = b → a ≮ b.
405 apply (lt_to_not_eq b b)
411 theorem lt_n_m_to_not_lt_m_Sn: ∀n,m. n < m → m ≮ S n.
417 generalize in match (le_S_S ? ? H);
419 generalize in match (transitive_le ? ? ? H2 H1);
421 apply (not_le_Sn_n ? H3).
424 ntheorem not_eq_to_le_to_lt: ∀n,m. n≠m → n≤m → n<m.
425 #n; #m; #Hneq; #Hle; ncases (le_to_or_lt_eq ?? Hle); //;
426 #Heq; nelim (Hneq Heq); nqed.
429 ntheorem le_n_O_to_eq : ∀n:nat. n ≤ O → O=n.
430 #n; ncases n; //; #a ; #abs; nelim (not_le_Sn_O ? abs); nqed.
432 ntheorem le_n_O_elim: ∀n:nat. n ≤ O → ∀P: nat →Prop. P O → P n.
433 #n; ncases n; //; #a; #abs; nelim (not_le_Sn_O ? abs); nqed.
435 ntheorem le_n_Sm_elim : ∀n,m:nat.n ≤ S m →
436 ∀P:Prop. (S n ≤ S m → P) → (n=S m → P) → P.
437 #n; #m; #Hle; #P; nelim Hle; /3/; nqed.
441 ntheorem le_to_le_to_eq: ∀n,m. n ≤ m → m ≤ n → n = m.
442 napply nat_elim2; /4/; nqed.
444 ntheorem lt_O_S : ∀n:nat. O < S n.
448 (* other abstract properties *)
449 theorem antisymmetric_le : antisymmetric nat le.
450 unfold antisymmetric.intros 2.
451 apply (nat_elim2 (\lambda n,m.(n \leq m \to m \leq n \to n=m))).
452 intros.apply le_n_O_to_eq.assumption.
453 intros.apply False_ind.apply (not_le_Sn_O ? H).
454 intros.apply eq_f.apply H.
455 apply le_S_S_to_le.assumption.
456 apply le_S_S_to_le.assumption.
459 theorem antisym_le: \forall n,m:nat. n \leq m \to m \leq n \to n=m
460 \def antisymmetric_le.
462 theorem le_n_m_to_lt_m_Sn_to_eq_n_m: ∀n,m. n ≤ m → m < S n → n=m.
465 generalize in match (le_S_S_to_le ? ? H1);
472 (* well founded induction principles *)
474 ntheorem nat_elim1 : ∀n:nat.∀P:nat → Prop.
475 (∀m.(∀p. p < m → P p) → P m) → P n.
477 ncut (∀q:nat. q ≤ n → P q);/2/;
479 ##[#q; #HleO; (* applica male *)
480 napply (le_n_O_elim ? HleO);
482 napply False_ind; /2/;
483 ##|#p; #Hind; #q; #HleS;
484 napply H; #a; #lta; napply Hind;
485 napply le_S_S_to_le;/2/;
489 (* some properties of functions *)
491 definition increasing \def \lambda f:nat \to nat.
492 \forall n:nat. f n < f (S n).
494 theorem increasing_to_monotonic: \forall f:nat \to nat.
495 increasing f \to monotonic nat lt f.
496 unfold monotonic.unfold lt.unfold increasing.unfold lt.intros.elim H1.apply H.
497 apply (trans_le ? (f n1)).
498 assumption.apply (trans_le ? (S (f n1))).
503 theorem le_n_fn: \forall f:nat \to nat. (increasing f)
504 \to \forall n:nat. n \le (f n).
507 apply (trans_le ? (S (f n1))).
508 apply le_S_S.apply H1.
509 simplify in H. unfold increasing in H.unfold lt in H.apply H.
512 theorem increasing_to_le: \forall f:nat \to nat. (increasing f)
513 \to \forall m:nat. \exists i. m \le (f i).
515 apply (ex_intro ? ? O).apply le_O_n.
517 apply (ex_intro ? ? (S a)).
518 apply (trans_le ? (S (f a))).
519 apply le_S_S.assumption.
520 simplify in H.unfold increasing in H.unfold lt in H.
524 theorem increasing_to_le2: \forall f:nat \to nat. (increasing f)
525 \to \forall m:nat. (f O) \le m \to
526 \exists i. (f i) \le m \land m <(f (S i)).
528 apply (ex_intro ? ? O).
529 split.apply le_n.apply H.
531 cut ((S n1) < (f (S a)) \lor (S n1) = (f (S a))).
533 apply (ex_intro ? ? a).
534 split.apply le_S. assumption.assumption.
535 apply (ex_intro ? ? (S a)).
536 split.rewrite < H7.apply le_n.
539 apply le_to_or_lt_eq.apply H6.
543 (*********************** monotonicity ***************************)
544 ntheorem monotonic_le_plus_r:
545 ∀n:nat.monotonic nat le (λm.n + m).
546 #n; #a; #b; nelim n; nnormalize; //;
547 #m; #H; #leab;napply le_S_S; /2/; nqed.
550 ntheorem le_plus_r: ∀p,n,m:nat. n ≤ m → p + n ≤ p + m
551 ≝ monotonic_le_plus_r. *)
553 ntheorem monotonic_le_plus_l:
554 ∀m:nat.monotonic nat le (λn.n + m).
558 ntheorem le_plus_l: \forall p,n,m:nat. n \le m \to n + p \le m + p
559 \def monotonic_le_plus_l. *)
561 ntheorem le_plus: ∀n1,n2,m1,m2:nat. n1 ≤ n2 \to m1 ≤ m2
563 #n1; #n2; #m1; #m2; #len; #lem; napply (transitive_le ? (n1+m2));
566 ntheorem le_plus_n :∀n,m:nat. m ≤ n + m.
569 ntheorem le_plus_n_r :∀n,m:nat. m ≤ m + n.
572 ntheorem eq_plus_to_le: ∀n,m,p:nat.n=m+p → m ≤ n.
575 ntheorem le_plus_to_le: ∀a,n,m. a + n ≤ a + m → n ≤ m.
576 #a; nelim a; nnormalize; /3/; nqed.
578 ntheorem le_plus_to_le_r: ∀a,n,m. n + a ≤ m +a → n ≤ m.
583 ntheorem monotonic_lt_plus_r:
584 ∀n:nat.monotonic nat lt (λm.n+m).
588 variant lt_plus_r: \forall n,p,q:nat. p < q \to n + p < n + q \def
589 monotonic_lt_plus_r. *)
591 ntheorem monotonic_lt_plus_l:
592 ∀n:nat.monotonic nat lt (λm.m+n).
596 variant lt_plus_l: \forall n,p,q:nat. p < q \to p + n < q + n \def
597 monotonic_lt_plus_l. *)
599 ntheorem lt_plus: ∀n,m,p,q:nat. n < m → p < q → n + p < m + q.
600 #n; #m; #p; #q; #ltnm; #ltpq;
601 napply (transitive_lt ? (n+q));/2/; nqed.
603 ntheorem lt_plus_to_lt_l :∀n,p,q:nat. p+n < q+n → p<q.
606 ntheorem lt_plus_to_lt_r :∀n,p,q:nat. n+p < n+q → p<q.
609 ntheorem le_to_lt_to_plus_lt: ∀a,b,c,d:nat.
610 a ≤ c → b < d → a + b < c+d.
611 (* bello /2/ un po' lento *)
612 #a; #b; #c; #d; #leac; #lebd;
613 nnormalize; napplyS le_plus; //; nqed.
616 ntheorem monotonic_le_times_r:
617 ∀n:nat.monotonic nat le (λm. n * m).
618 #n; #x; #y; #lexy; nelim n; nnormalize;//;(* lento /2/;*)
619 #a; #lea; napply le_plus; //;
623 ntheorem le_times_r: \forall p,n,m:nat. n \le m \to p*n \le p*m
624 \def monotonic_le_times_r. *)
626 ntheorem monotonic_le_times_l:
627 ∀m:nat.monotonic nat le (λn.n*m).
631 theorem le_times_l: \forall p,n,m:nat. n \le m \to n*p \le m*p
632 \def monotonic_le_times_l. *)
634 ntheorem le_times: ∀n1,n2,m1,m2:nat.
635 n1 ≤ n2 → m1 ≤ m2 → n1*m1 ≤ n2*m2.
636 #n1; #n2; #m1; #m2; #len; #lem;
637 napply transitive_le; (* /2/ slow *)
638 ##[ ##| napply monotonic_le_times_l;//;
639 ##| napply monotonic_le_times_r;//;
643 ntheorem lt_times_n: ∀n,m:nat. O < n → m ≤ n*m.
644 #n; #m; #H; napplyS monotonic_le_times_l;
647 ntheorem le_times_to_le:
648 ∀a,n,m. O < a → a * n ≤ a * m → n ≤ m.
649 #a; napply nat_elim2; nnormalize;
651 ##|#n; #H1; #H2; napply False_ind;
652 ngeneralize in match H2;
654 napply (transitive_le ? (S n));/2/;
655 ##|#n; #m; #H; #lta; #le;
656 napply le_S_S; napply H; /2/;
660 ntheorem le_S_times_2: ∀n,m.O < m → n ≤ m → S n ≤ 2*m.
661 #n; #m; #posm; #lenm; (* interessante *)
662 napplyS (le_plus n); //; nqed.
666 ntheorem lt_O_times_S_S: ∀n,m:nat.O < (S n)*(S m).
667 intros.simplify.unfold lt.apply le_S_S.apply le_O_n.
671 ntheorem lt_times_eq_O: \forall a,b:nat.
672 O < a → a * b = O → b = O.
679 rewrite > (S_pred a) in H1
681 apply (eq_to_not_lt O ((S (pred a))*(S m)))
684 | apply lt_O_times_S_S
691 theorem O_lt_times_to_O_lt: \forall a,c:nat.
692 O \lt (a * c) \to O \lt a.
704 lemma lt_times_to_lt_O: \forall i,n,m:nat. i < n*m \to O < m.
706 elim (le_to_or_lt_eq O ? (le_O_n m))
710 rewrite < times_n_O in H.
711 apply (not_le_Sn_O ? H)
716 ntheorem monotonic_lt_times_r:
717 ∀n:nat.monotonic nat lt (λm.(S n)*m).
721 simplify.rewrite < plus_n_O.rewrite < plus_n_O.assumption.
722 apply lt_plus.assumption.assumption.
725 ntheorem monotonic_lt_times_l:
726 ∀c:nat. O < c → monotonic nat lt (λt.(t*c)).
727 #c; #posc; #n; #m; #ltnm;
728 nelim ltnm; nnormalize;
729 ##[napplyS monotonic_lt_plus_l;//;
730 ##|#a; #_; #lt1; napply (transitive_le ??? lt1);//;
734 ntheorem monotonic_lt_times_r:
735 ∀c:nat. O < c → monotonic nat lt (λt.(c*t)).
737 #c; #posc; #n; #m; #ltnm;
738 (* why?? napplyS (monotonic_lt_times_l c posc n m ltnm); *)
739 nrewrite > (symmetric_times c n);
740 nrewrite > (symmetric_times c m);
741 napply monotonic_lt_times_l;//;
744 ntheorem lt_to_le_to_lt_times:
745 ∀n,m,p,q:nat. n < m → p ≤ q → O < q → n*p < m*q.
746 #n; #m; #p; #q; #ltnm; #lepq; #posq;
747 napply (le_to_lt_to_lt ? (n*q));
748 ##[napply monotonic_le_times_r;//;
749 ##|napply monotonic_lt_times_l;//;
753 ntheorem lt_times:∀n,m,p,q:nat. n<m → p<q → n*p < m*q.
754 #n; #m; #p; #q; #ltnm; #ltpq;
755 napply lt_to_le_to_lt_times;/2/;
758 ntheorem lt_times_n_to_lt_l:
759 ∀n,p,q:nat. O < n → p*n < q*n → p < q.
760 #n; #p; #q; #posn; #Hlt;
761 nelim (decidable_lt p q);//;
762 #nltpq;napply False_ind;
763 napply (lt_to_not_le ? ? Hlt);
764 napply monotonic_le_times_l;/3/;
767 ntheorem lt_times_n_to_lt_r:
768 ∀n,p,q:nat. O < n → n*p < n*q → p < q.
769 #n; #p; #q; #posn; #Hlt;
770 napply (lt_times_n_to_lt_l ??? posn);//;
774 theorem nat_compare_times_l : \forall n,p,q:nat.
775 nat_compare p q = nat_compare ((S n) * p) ((S n) * q).
776 intros.apply nat_compare_elim.intro.
777 apply nat_compare_elim.
780 apply (inj_times_r n).assumption.
781 apply lt_to_not_eq. assumption.
783 apply (lt_times_to_lt_r n).assumption.
784 apply le_to_not_lt.apply lt_to_le.assumption.
785 intro.rewrite < H.rewrite > nat_compare_n_n.reflexivity.
786 intro.apply nat_compare_elim.intro.
788 apply (lt_times_to_lt_r n).assumption.
789 apply le_to_not_lt.apply lt_to_le.assumption.
792 apply (inj_times_r n).assumption.
793 apply lt_to_not_eq.assumption.
798 theorem lt_times_plus_times: \forall a,b,n,m:nat.
799 a < n \to b < m \to a*m + b < n*m.
802 [intros.apply False_ind.apply (not_le_Sn_O ? H)
806 change with (S b+a*m1 \leq m1+m*m1).
810 [apply le_S_S_to_le.assumption
817 (************************** minus ******************************)
825 | S q ⇒ minus p q ]].
827 interpretation "natural minus" 'minus x y = (minus x y).
829 ntheorem minus_S_S: ∀n,m:nat.S n - S m = n -m.
832 ntheorem minus_O_n: ∀n:nat.O=O-n.
833 #n; ncases n; //; nqed.
835 ntheorem minus_n_O: ∀n:nat.n=n-O.
836 #n; ncases n; //; nqed.
838 ntheorem minus_n_n: ∀n:nat.O=n-n.
839 #n; nelim n; //; nqed.
841 ntheorem minus_Sn_n: ∀n:nat. S O = (S n)-n.
842 #n; nelim n; //; nqed.
844 ntheorem minus_Sn_m: ∀m,n:nat. m ≤ n → S n -m = S (n-m).
845 (* qualcosa da capire qui
846 #n; #m; #lenm; nelim lenm; napplyS refl_eq. *)
849 ##|#n; #abs; napply False_ind; /2/.
850 ##|#n; #m; #Hind; #c; napplyS Hind; /2/;
854 ntheorem not_eq_to_le_to_le_minus:
855 ∀n,m.n ≠ m → n ≤ m → n ≤ m - 1.
856 #n; #m; ncases m;//; #m; nnormalize;
857 #H; #H1; napply le_S_S_to_le;
858 napplyS (not_eq_to_le_to_lt n (S m) H H1);
861 ntheorem eq_minus_S_pred: ∀n,m. n - (S m) = pred(n -m).
862 napply nat_elim2; //; nqed.
865 ∀m,n,p:nat. m ≤ n → (n-m)+p = (n+p)-m.
868 ##|#n; #p; #abs; napply False_ind; /2/;
873 ntheorem minus_plus_m_m: ∀n,m:nat.n = (n+m)-m.
874 #n; #m; napplyS (plus_minus m m n); //; nqed.
876 ntheorem plus_minus_m_m: ∀n,m:nat.
877 m \leq n \to n = (n-m)+m.
878 #n; #m; #lemn; napplyS symmetric_eq;
879 napplyS (plus_minus m n m); //; nqed.
881 ntheorem le_plus_minus_m_m: ∀n,m:nat. n ≤ (n-m)+m.
884 ##|#a; #Hind; #m; ncases m;//;
885 nnormalize; #n;napplyS le_S_S;//
889 ntheorem minus_to_plus :∀n,m,p:nat.
890 m ≤ n → n-m = p → n = m+p.
891 #n; #m; #p; #lemn; #eqp; napplyS plus_minus_m_m; //;
894 ntheorem plus_to_minus :∀n,m,p:nat.n = m+p → n-m = p.
895 (* /4/ done in 43.5 *)
898 napplyS (minus_plus_m_m p m);
901 ntheorem minus_pred_pred : ∀n,m:nat. O < n → O < m →
902 pred n - pred m = n - m.
903 #n; #m; #posn; #posm;
904 napply (lt_O_n_elim n posn);
905 napply (lt_O_n_elim m posm);//.
909 theorem eq_minus_n_m_O: \forall n,m:nat.
910 n \leq m \to n-m = O.
912 apply (nat_elim2 (\lambda n,m.n \leq m \to n-m = O)).
913 intros.simplify.reflexivity.
914 intros.apply False_ind.
918 simplify.apply H.apply le_S_S_to_le. apply H1.
921 theorem le_SO_minus: \forall n,m:nat.S n \leq m \to S O \leq m-n.
922 intros.elim H.elim (minus_Sn_n n).apply le_n.
923 rewrite > minus_Sn_m.
924 apply le_S.assumption.
925 apply lt_to_le.assumption.
928 theorem minus_le_S_minus_S: \forall n,m:nat. m-n \leq S (m-(S n)).
930 apply (nat_elim2 (\lambda n,m.m-n \leq S (m-(S n)))).
931 intro.elim n1.simplify.apply le_n_Sn.
932 simplify.rewrite < minus_n_O.apply le_n.
933 intros.simplify.apply le_n_Sn.
934 intros.simplify.apply H.
937 theorem lt_minus_S_n_to_le_minus_n : \forall n,m,p:nat. m-(S n) < p \to m-n \leq p.
940 (* end auto($Revision: 9739 $) proof: TIME=1.33 SIZE=100 DEPTH=100 *)
941 apply (trans_le (m-n) (S (m-(S n))) p).
942 apply minus_le_S_minus_S.
946 theorem le_minus_m: \forall n,m:nat. n-m \leq n.
947 intros.apply (nat_elim2 (\lambda m,n. n-m \leq n)).
948 intros.rewrite < minus_n_O.apply le_n.
949 intros.simplify.apply le_n.
950 intros.simplify.apply le_S.assumption.
953 theorem lt_minus_m: \forall n,m:nat. O < n \to O < m \to n-m \lt n.
954 intros.apply (lt_O_n_elim n H).intro.
955 apply (lt_O_n_elim m H1).intro.
956 simplify.unfold lt.apply le_S_S.apply le_minus_m.
959 theorem minus_le_O_to_le: \forall n,m:nat. n-m \leq O \to n \leq m.
961 apply (nat_elim2 (\lambda n,m:nat.n-m \leq O \to n \leq m)).
963 simplify.intros. assumption.
964 simplify.intros.apply le_S_S.apply H.assumption.
968 (* monotonicity and galois *)
970 ntheorem monotonic_le_minus_l:
971 ∀p,q,n:nat. q ≤ p → q-n ≤ p-n.
972 napply nat_elim2; #p; #q;
973 ##[#lePO; napply (le_n_O_elim ? lePO);//;
975 ##|#Hind; #n; ncases n;
977 ##|#a; #leSS; napply Hind; /2/;
982 ntheorem le_minus_to_plus: ∀n,m,p. n-m ≤ p → n≤ p+m.
984 napply transitive_le;
985 ##[##|napply le_plus_minus_m_m
986 ##|napply monotonic_le_plus_l;//;
990 ntheorem le_plus_to_minus: ∀n,m,p. n ≤ p+m → n-m ≤ p.
993 napplyS monotonic_le_minus_l;//;
996 ntheorem monotonic_le_minus_r:
997 ∀p,q,n:nat. q ≤ p → n-p ≤ n-q.
999 napply le_plus_to_minus;
1000 napply (transitive_le ??? (le_plus_minus_m_m ? q));/2/;
1003 (*********************** boolean arithmetics ********************)
1004 include "basics/bool.ma".
1008 [ O ⇒ match m with [ O ⇒ true | S q ⇒ false]
1009 | S p ⇒ match m with [ O ⇒ false | S q ⇒ eqb p q]
1013 ntheorem eqb_to_Prop: ∀n,m:nat.
1014 match (eqb n m) with
1015 [ true \Rightarrow n = m
1016 | false \Rightarrow n \neq m].
1019 (\lambda n,m:nat.match (eqb n m) with
1020 [ true \Rightarrow n = m
1021 | false \Rightarrow n \neq m])).
1023 simplify.reflexivity.
1024 simplify.apply not_eq_O_S.
1026 simplify.unfold Not.
1027 intro. apply (not_eq_O_S n1).apply sym_eq.assumption.
1029 generalize in match H.
1031 simplify.apply eq_f.apply H1.
1032 simplify.unfold Not.intro.apply H1.apply inj_S.assumption.
1036 ntheorem eqb_elim : ∀ n,m:nat.∀ P:bool → Prop.
1037 (n=m → (P true)) → (n ≠ m → (P false)) → (P (eqb n m)).
1039 ##[#n; ncases n; nnormalize; /3/;
1045 ntheorem eqb_n_n: ∀n. eqb n n = true.
1046 #n; nelim n; nnormalize; //.
1049 ntheorem eqb_true_to_eq: ∀n,m:nat. eqb n m = true → n = m.
1050 #n; #m; napply (eqb_elim n m);//;
1051 #_; #abs; napply False_ind; /2/;
1054 ntheorem eqb_false_to_not_eq: ∀n,m:nat. eqb n m = false → n ≠ m.
1055 #n; #m; napply (eqb_elim n m);/2/;
1058 ntheorem eq_to_eqb_true: ∀n,m:nat.
1059 n = m → eqb n m = true.
1062 ntheorem not_eq_to_eqb_false: ∀n,m:nat.
1063 n ≠ m → eqb n m = false.
1065 nelim (true_or_false (eqb n m)); //;
1066 #Heq; napply False_ind; napply noteq;/2/;
1075 | (S q) ⇒ leb p q]].
1077 ntheorem leb_elim: ∀n,m:nat. ∀P:bool → Prop.
1078 (n ≤ m → P true) → (n ≰ m → P false) → P (leb n m).
1079 napply nat_elim2; nnormalize;
1082 ##|#n; #m; #Hind; #P; #Pt; #Pf; napply Hind;
1083 ##[#lenm; napply Pt; napply le_S_S;//;
1084 ##|#nlenm; napply Pf; #leSS; /3/;
1089 ntheorem leb_true_to_le:∀n,m.leb n m = true → n ≤ m.
1090 #n; #m; napply leb_elim;
1092 ##|#_; #abs; napply False_ind; /2/;
1096 ntheorem leb_false_to_not_le:∀n,m.
1097 leb n m = false → n ≰ m.
1098 #n; #m; napply leb_elim;
1099 ##[#_; #abs; napply False_ind; /2/;
1104 ntheorem le_to_leb_true: ∀n,m. n ≤ m → leb n m = true.
1105 #n; #m; napply leb_elim; //;
1106 #H; #H1; napply False_ind; /2/;
1109 ntheorem lt_to_leb_false: ∀n,m. m < n → leb n m = false.
1110 #n; #m; napply leb_elim; //;
1111 #H; #H1; napply False_ind; /2/;
1115 ndefinition ltb ≝λn,m. leb (S n) m.
1117 ntheorem ltb_elim: ∀n,m:nat. ∀P:bool → Prop.
1118 (n < m → P true) → (n ≮ m → P false) → P (ltb n m).
1119 #n; #m; #P; #Hlt; #Hnlt;
1120 napply leb_elim; /3/; nqed.
1122 ntheorem ltb_true_to_lt:∀n,m.ltb n m = true → n < m.
1123 #n; #m; #Hltb; napply leb_true_to_le; nassumption;
1126 ntheorem ltb_false_to_not_lt:∀n,m.
1127 ltb n m = false → n ≮ m.
1128 #n; #m; #Hltb; napply leb_false_to_not_le; nassumption;
1131 ntheorem lt_to_ltb_true: ∀n,m. n < m → ltb n m = true.
1132 #n; #m; #Hltb; napply le_to_leb_true; nassumption;
1135 ntheorem le_to_ltb_false: ∀n,m. m \le n → ltb n m = false.
1136 #n; #m; #Hltb; napply lt_to_leb_false; /2/;