1
(************************************************************************)
2
(* v * The Coq Proof Assistant / The Coq Development Team *)
3
(* <O___,, * CNRS-Ecole Polytechnique-INRIA Futurs-Universite Paris Sud *)
4
(* \VV/ **************************************************************)
5
(* // * This file is distributed under the terms of the *)
6
(* * GNU Lesser General Public License Version 2.1 *)
7
(************************************************************************)
8
(* Evgeny Makarov, INRIA, 2007 *)
9
(************************************************************************)
11
(*i $Id: NMulOrder.v 11040 2008-06-03 00:04:16Z letouzey $ i*)
13
Require Export NAddOrder.
15
Module NMulOrderPropFunct (Import NAxiomsMod : NAxiomsSig).
16
Module Export NAddOrderPropMod := NAddOrderPropFunct NAxiomsMod.
17
Open Local Scope NatScope.
20
forall p q n m : N, S p == q -> (p * n < p * m <-> q * n + m < q * m + n).
23
Theorem mul_lt_mono_pos_l : forall p n m : N, 0 < p -> (n < m <-> p * n < p * m).
24
Proof NZmul_lt_mono_pos_l.
26
Theorem mul_lt_mono_pos_r : forall p n m : N, 0 < p -> (n < m <-> n * p < m * p).
27
Proof NZmul_lt_mono_pos_r.
29
Theorem mul_cancel_l : forall n m p : N, p ~= 0 -> (p * n == p * m <-> n == m).
32
Theorem mul_cancel_r : forall n m p : N, p ~= 0 -> (n * p == m * p <-> n == m).
35
Theorem mul_id_l : forall n m : N, m ~= 0 -> (n * m == m <-> n == 1).
38
Theorem mul_id_r : forall n m : N, n ~= 0 -> (n * m == n <-> m == 1).
41
Theorem mul_le_mono_pos_l : forall n m p : N, 0 < p -> (n <= m <-> p * n <= p * m).
42
Proof NZmul_le_mono_pos_l.
44
Theorem mul_le_mono_pos_r : forall n m p : N, 0 < p -> (n <= m <-> n * p <= m * p).
45
Proof NZmul_le_mono_pos_r.
47
Theorem mul_pos_pos : forall n m : N, 0 < n -> 0 < m -> 0 < n * m.
50
Theorem lt_1_mul_pos : forall n m : N, 1 < n -> 0 < m -> 1 < n * m.
53
Theorem eq_mul_0 : forall n m : N, n * m == 0 <-> n == 0 \/ m == 0.
56
Theorem neq_mul_0 : forall n m : N, n ~= 0 /\ m ~= 0 <-> n * m ~= 0.
59
Theorem eq_square_0 : forall n : N, n * n == 0 <-> n == 0.
62
Theorem eq_mul_0_l : forall n m : N, n * m == 0 -> m ~= 0 -> n == 0.
65
Theorem eq_mul_0_r : forall n m : N, n * m == 0 -> n ~= 0 -> m == 0.
68
Theorem square_lt_mono : forall n m : N, n < m <-> n * n < m * m.
70
intros n m; split; intro;
71
[apply NZsquare_lt_mono_nonneg | apply NZsquare_lt_simpl_nonneg];
72
try assumption; apply le_0_l.
75
Theorem square_le_mono : forall n m : N, n <= m <-> n * n <= m * m.
77
intros n m; split; intro;
78
[apply NZsquare_le_mono_nonneg | apply NZsquare_le_simpl_nonneg];
79
try assumption; apply le_0_l.
82
Theorem mul_2_mono_l : forall n m : N, n < m -> 1 + (1 + 1) * n < (1 + 1) * m.
85
(* Theorems that are either not valid on Z or have different proofs on N and Z *)
87
Theorem mul_le_mono_l : forall n m p : N, n <= m -> p * n <= p * m.
89
intros; apply NZmul_le_mono_nonneg_l. apply le_0_l. assumption.
92
Theorem mul_le_mono_r : forall n m p : N, n <= m -> n * p <= m * p.
94
intros; apply NZmul_le_mono_nonneg_r. apply le_0_l. assumption.
97
Theorem mul_lt_mono : forall n m p q : N, n < m -> p < q -> n * p < m * q.
99
intros; apply NZmul_lt_mono_nonneg; try assumption; apply le_0_l.
102
Theorem mul_le_mono : forall n m p q : N, n <= m -> p <= q -> n * p <= m * q.
104
intros; apply NZmul_le_mono_nonneg; try assumption; apply le_0_l.
107
Theorem lt_0_mul : forall n m : N, n * m > 0 <-> n > 0 /\ m > 0.
109
intros n m; split; [intro H | intros [H1 H2]].
110
apply -> NZlt_0_mul in H. destruct H as [[H1 H2] | [H1 H2]]. now split. false_hyp H1 nlt_0_r.
111
now apply NZmul_pos_pos.
114
Notation mul_pos := lt_0_mul (only parsing).
116
Theorem eq_mul_1 : forall n m : N, n * m == 1 <-> n == 1 /\ m == 1.
119
split; [| intros [H1 H2]; now rewrite H1, H2, mul_1_l].
120
intro H; destruct (NZlt_trichotomy n 1) as [H1 | [H1 | H1]].
121
apply -> lt_1_r in H1. rewrite H1, mul_0_l in H. false_hyp H neq_0_succ.
122
rewrite H1, mul_1_l in H; now split.
123
destruct (eq_0_gt_0_cases m) as [H2 | H2].
124
rewrite H2, mul_0_r in H; false_hyp H neq_0_succ.
125
apply -> (mul_lt_mono_pos_r m) in H1; [| assumption]. rewrite mul_1_l in H1.
126
assert (H3 : 1 < n * m) by now apply (lt_1_l 0 m).
127
rewrite H in H3; false_hyp H3 lt_irrefl.
130
End NMulOrderPropFunct.