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: ZLt.v 11040 2008-06-03 00:04:16Z letouzey $ i*)
15
Module ZOrderPropFunct (Import ZAxiomsMod : ZAxiomsSig).
16
Module Export ZMulPropMod := ZMulPropFunct ZAxiomsMod.
17
Open Local Scope IntScope.
22
forall n1 n2 : Z, n1 == n2 -> forall m1 m2 : Z, m1 == m2 -> (n1 < m1 <-> n2 < m2).
26
forall n1 n2 : Z, n1 == n2 -> forall m1 m2 : Z, m1 == m2 -> (n1 <= m1 <-> n2 <= m2).
30
forall n1 n2 : Z, n1 == n2 -> forall m1 m2 : Z, m1 == m2 -> Zmin n1 m1 == Zmin n2 m2.
34
forall n1 n2 : Z, n1 == n2 -> forall m1 m2 : Z, m1 == m2 -> Zmax n1 m1 == Zmax n2 m2.
37
Theorem Zlt_eq_cases : forall n m : Z, n <= m <-> n < m \/ n == m.
40
Theorem Zlt_irrefl : forall n : Z, ~ n < n.
43
Theorem Zlt_succ_r : forall n m : Z, n < S m <-> n <= m.
46
Theorem Zmin_l : forall n m : Z, n <= m -> Zmin n m == n.
49
Theorem Zmin_r : forall n m : Z, m <= n -> Zmin n m == m.
52
Theorem Zmax_l : forall n m : Z, m <= n -> Zmax n m == n.
55
Theorem Zmax_r : forall n m : Z, n <= m -> Zmax n m == m.
58
(* Renaming theorems from NZOrder.v *)
60
Theorem Zlt_le_incl : forall n m : Z, n < m -> n <= m.
63
Theorem Zlt_neq : forall n m : Z, n < m -> n ~= m.
66
Theorem Zle_neq : forall n m : Z, n < m <-> n <= m /\ n ~= m.
69
Theorem Zle_refl : forall n : Z, n <= n.
72
Theorem Zlt_succ_diag_r : forall n : Z, n < S n.
73
Proof NZlt_succ_diag_r.
75
Theorem Zle_succ_diag_r : forall n : Z, n <= S n.
76
Proof NZle_succ_diag_r.
78
Theorem Zlt_0_1 : 0 < 1.
81
Theorem Zle_0_1 : 0 <= 1.
84
Theorem Zlt_lt_succ_r : forall n m : Z, n < m -> n < S m.
87
Theorem Zle_le_succ_r : forall n m : Z, n <= m -> n <= S m.
90
Theorem Zle_succ_r : forall n m : Z, n <= S m <-> n <= m \/ n == S m.
93
Theorem Zneq_succ_diag_l : forall n : Z, S n ~= n.
94
Proof NZneq_succ_diag_l.
96
Theorem Zneq_succ_diag_r : forall n : Z, n ~= S n.
97
Proof NZneq_succ_diag_r.
99
Theorem Znlt_succ_diag_l : forall n : Z, ~ S n < n.
100
Proof NZnlt_succ_diag_l.
102
Theorem Znle_succ_diag_l : forall n : Z, ~ S n <= n.
103
Proof NZnle_succ_diag_l.
105
Theorem Zle_succ_l : forall n m : Z, S n <= m <-> n < m.
108
Theorem Zlt_succ_l : forall n m : Z, S n < m -> n < m.
111
Theorem Zsucc_lt_mono : forall n m : Z, n < m <-> S n < S m.
112
Proof NZsucc_lt_mono.
114
Theorem Zsucc_le_mono : forall n m : Z, n <= m <-> S n <= S m.
115
Proof NZsucc_le_mono.
117
Theorem Zlt_asymm : forall n m, n < m -> ~ m < n.
120
Notation Zlt_ngt := Zlt_asymm (only parsing).
122
Theorem Zlt_trans : forall n m p : Z, n < m -> m < p -> n < p.
125
Theorem Zle_trans : forall n m p : Z, n <= m -> m <= p -> n <= p.
128
Theorem Zle_lt_trans : forall n m p : Z, n <= m -> m < p -> n < p.
131
Theorem Zlt_le_trans : forall n m p : Z, n < m -> m <= p -> n < p.
134
Theorem Zle_antisymm : forall n m : Z, n <= m -> m <= n -> n == m.
137
Theorem Zlt_1_l : forall n m : Z, 0 < n -> n < m -> 1 < m.
140
(** Trichotomy, decidability, and double negation elimination *)
142
Theorem Zlt_trichotomy : forall n m : Z, n < m \/ n == m \/ m < n.
143
Proof NZlt_trichotomy.
145
Notation Zlt_eq_gt_cases := Zlt_trichotomy (only parsing).
147
Theorem Zlt_gt_cases : forall n m : Z, n ~= m <-> n < m \/ n > m.
150
Theorem Zle_gt_cases : forall n m : Z, n <= m \/ n > m.
153
Theorem Zlt_ge_cases : forall n m : Z, n < m \/ n >= m.
156
Theorem Zle_ge_cases : forall n m : Z, n <= m \/ n >= m.
159
(** Instances of the previous theorems for m == 0 *)
161
Theorem Zneg_pos_cases : forall n : Z, n ~= 0 <-> n < 0 \/ n > 0.
163
intro; apply Zlt_gt_cases.
166
Theorem Znonpos_pos_cases : forall n : Z, n <= 0 \/ n > 0.
168
intro; apply Zle_gt_cases.
171
Theorem Zneg_nonneg_cases : forall n : Z, n < 0 \/ n >= 0.
173
intro; apply Zlt_ge_cases.
176
Theorem Znonpos_nonneg_cases : forall n : Z, n <= 0 \/ n >= 0.
178
intro; apply Zle_ge_cases.
181
Theorem Zle_ngt : forall n m : Z, n <= m <-> ~ n > m.
184
Theorem Znlt_ge : forall n m : Z, ~ n < m <-> n >= m.
187
Theorem Zlt_dec : forall n m : Z, decidable (n < m).
190
Theorem Zlt_dne : forall n m, ~ ~ n < m <-> n < m.
193
Theorem Znle_gt : forall n m : Z, ~ n <= m <-> n > m.
196
Theorem Zlt_nge : forall n m : Z, n < m <-> ~ n >= m.
199
Theorem Zle_dec : forall n m : Z, decidable (n <= m).
202
Theorem Zle_dne : forall n m : Z, ~ ~ n <= m <-> n <= m.
205
Theorem Znlt_succ_r : forall n m : Z, ~ m < S n <-> n < m.
208
Theorem Zlt_exists_pred :
209
forall z n : Z, z < n -> exists k : Z, n == S k /\ z <= k.
210
Proof NZlt_exists_pred.
212
Theorem Zlt_succ_iter_r :
213
forall (n : nat) (m : Z), m < NZsucc_iter (Datatypes.S n) m.
214
Proof NZlt_succ_iter_r.
216
Theorem Zneq_succ_iter_l :
217
forall (n : nat) (m : Z), NZsucc_iter (Datatypes.S n) m ~= m.
218
Proof NZneq_succ_iter_l.
220
(** Stronger variant of induction with assumptions n >= 0 (n < 0)
221
in the induction step *)
223
Theorem Zright_induction :
224
forall A : Z -> Prop, predicate_wd Zeq A ->
226
(forall n : Z, z <= n -> A n -> A (S n)) ->
227
forall n : Z, z <= n -> A n.
228
Proof NZright_induction.
230
Theorem Zleft_induction :
231
forall A : Z -> Prop, predicate_wd Zeq A ->
233
(forall n : Z, n < z -> A (S n) -> A n) ->
234
forall n : Z, n <= z -> A n.
235
Proof NZleft_induction.
237
Theorem Zright_induction' :
238
forall A : Z -> Prop, predicate_wd Zeq A ->
240
(forall n : Z, n <= z -> A n) ->
241
(forall n : Z, z <= n -> A n -> A (S n)) ->
243
Proof NZright_induction'.
245
Theorem Zleft_induction' :
246
forall A : Z -> Prop, predicate_wd Zeq A ->
248
(forall n : Z, z <= n -> A n) ->
249
(forall n : Z, n < z -> A (S n) -> A n) ->
251
Proof NZleft_induction'.
253
Theorem Zstrong_right_induction :
254
forall A : Z -> Prop, predicate_wd Zeq A ->
256
(forall n : Z, z <= n -> (forall m : Z, z <= m -> m < n -> A m) -> A n) ->
257
forall n : Z, z <= n -> A n.
258
Proof NZstrong_right_induction.
260
Theorem Zstrong_left_induction :
261
forall A : Z -> Prop, predicate_wd Zeq A ->
263
(forall n : Z, n <= z -> (forall m : Z, m <= z -> S n <= m -> A m) -> A n) ->
264
forall n : Z, n <= z -> A n.
265
Proof NZstrong_left_induction.
267
Theorem Zstrong_right_induction' :
268
forall A : Z -> Prop, predicate_wd Zeq A ->
270
(forall n : Z, n <= z -> A n) ->
271
(forall n : Z, z <= n -> (forall m : Z, z <= m -> m < n -> A m) -> A n) ->
273
Proof NZstrong_right_induction'.
275
Theorem Zstrong_left_induction' :
276
forall A : Z -> Prop, predicate_wd Zeq A ->
278
(forall n : Z, z <= n -> A n) ->
279
(forall n : Z, n <= z -> (forall m : Z, m <= z -> S n <= m -> A m) -> A n) ->
281
Proof NZstrong_left_induction'.
283
Theorem Zorder_induction :
284
forall A : Z -> Prop, predicate_wd Zeq A ->
286
(forall n : Z, z <= n -> A n -> A (S n)) ->
287
(forall n : Z, n < z -> A (S n) -> A n) ->
289
Proof NZorder_induction.
291
Theorem Zorder_induction' :
292
forall A : Z -> Prop, predicate_wd Zeq A ->
294
(forall n : Z, z <= n -> A n -> A (S n)) ->
295
(forall n : Z, n <= z -> A n -> A (P n)) ->
297
Proof NZorder_induction'.
299
Theorem Zorder_induction_0 :
300
forall A : Z -> Prop, predicate_wd Zeq A ->
302
(forall n : Z, 0 <= n -> A n -> A (S n)) ->
303
(forall n : Z, n < 0 -> A (S n) -> A n) ->
305
Proof NZorder_induction_0.
307
Theorem Zorder_induction'_0 :
308
forall A : Z -> Prop, predicate_wd Zeq A ->
310
(forall n : Z, 0 <= n -> A n -> A (S n)) ->
311
(forall n : Z, n <= 0 -> A n -> A (P n)) ->
313
Proof NZorder_induction'_0.
315
Ltac Zinduct n := induction_maker n ltac:(apply Zorder_induction_0).
317
(** Elimintation principle for < *)
320
forall A : Z -> Prop, predicate_wd Zeq A ->
321
forall n : Z, A (S n) ->
322
(forall m : Z, n < m -> A m -> A (S m)) -> forall m : Z, n < m -> A m.
325
(** Elimintation principle for <= *)
328
forall A : Z -> Prop, predicate_wd Zeq A ->
330
(forall m : Z, n <= m -> A m -> A (S m)) -> forall m : Z, n <= m -> A m.
333
(** Well-founded relations *)
335
Theorem Zlt_wf : forall z : Z, well_founded (fun n m : Z => z <= n /\ n < m).
338
Theorem Zgt_wf : forall z : Z, well_founded (fun n m : Z => m < n /\ n <= z).
341
(* Theorems that are either not valid on N or have different proofs on N and Z *)
343
Theorem Zlt_pred_l : forall n : Z, P n < n.
345
intro n; rewrite <- (Zsucc_pred n) at 2; apply Zlt_succ_diag_r.
348
Theorem Zle_pred_l : forall n : Z, P n <= n.
350
intro; apply Zlt_le_incl; apply Zlt_pred_l.
353
Theorem Zlt_le_pred : forall n m : Z, n < m <-> n <= P m.
355
intros n m; rewrite <- (Zsucc_pred m); rewrite Zpred_succ. apply Zlt_succ_r.
358
Theorem Znle_pred_r : forall n : Z, ~ n <= P n.
360
intro; rewrite <- Zlt_le_pred; apply Zlt_irrefl.
363
Theorem Zlt_pred_le : forall n m : Z, P n < m <-> n <= m.
365
intros n m; rewrite <- (Zsucc_pred n) at 2.
366
symmetry; apply Zle_succ_l.
369
Theorem Zlt_lt_pred : forall n m : Z, n < m -> P n < m.
371
intros; apply <- Zlt_pred_le; now apply Zlt_le_incl.
374
Theorem Zle_le_pred : forall n m : Z, n <= m -> P n <= m.
376
intros; apply Zlt_le_incl; now apply <- Zlt_pred_le.
379
Theorem Zlt_pred_lt : forall n m : Z, n < P m -> n < m.
381
intros n m H; apply Zlt_trans with (P m); [assumption | apply Zlt_pred_l].
384
Theorem Zle_pred_lt : forall n m : Z, n <= P m -> n <= m.
386
intros; apply Zlt_le_incl; now apply <- Zlt_le_pred.
389
Theorem Zpred_lt_mono : forall n m : Z, n < m <-> P n < P m.
391
intros; rewrite Zlt_le_pred; symmetry; apply Zlt_pred_le.
394
Theorem Zpred_le_mono : forall n m : Z, n <= m <-> P n <= P m.
396
intros; rewrite <- Zlt_pred_le; now rewrite Zlt_le_pred.
399
Theorem Zlt_succ_lt_pred : forall n m : Z, S n < m <-> n < P m.
401
intros n m; now rewrite (Zpred_lt_mono (S n) m), Zpred_succ.
404
Theorem Zle_succ_le_pred : forall n m : Z, S n <= m <-> n <= P m.
406
intros n m; now rewrite (Zpred_le_mono (S n) m), Zpred_succ.
409
Theorem Zlt_pred_lt_succ : forall n m : Z, P n < m <-> n < S m.
411
intros; rewrite Zlt_pred_le; symmetry; apply Zlt_succ_r.
414
Theorem Zle_pred_lt_succ : forall n m : Z, P n <= m <-> n <= S m.
416
intros n m; now rewrite (Zpred_le_mono n (S m)), Zpred_succ.
419
Theorem Zneq_pred_l : forall n : Z, P n ~= n.
421
intro; apply Zlt_neq; apply Zlt_pred_l.
424
Theorem Zlt_n1_r : forall n m : Z, n < m -> m < 0 -> n < -1.
426
intros n m H1 H2. apply -> Zlt_le_pred in H2.
427
setoid_replace (P 0) with (-1) in H2. now apply NZlt_le_trans with m.
428
apply <- Zeq_opp_r. now rewrite Zopp_pred, Zopp_0.