1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 include "ground/arith/pnat_le_pred.ma".
16 include "ground/arith/pnat_lt.ma".
18 (* STRICT ORDER FOR POSITIVE INTEGERS ***************************************)
20 (* Destructions with ppred **************************************************)
22 lemma plt_des_gen (p) (q): p < q → q = ↑↓q.
24 #H elim (plt_inv_unit_dx … H)
27 (* Inversions with ppred ****************************************************)
29 lemma plt_inv_gen (p) (q): p < q → ∧∧ p ≤ ↓q & q = ↑↓q.
30 /2 width=1 by ple_inv_succ_sn/ qed-.
32 lemma plt_inv_succ_sn (p) (q): ↑p < q → ∧∧ p < ↓q & q = ↑↓q.
33 /2 width=1 by ple_inv_succ_sn/ qed-.
35 lemma plt_inv_pred_dx (p) (q): p < ↓q → ↑p < q.
36 #p #q #H >(plt_des_gen (𝟏) q)
37 [ /2 width=1 by plt_succ_bi/
38 | /3 width=3 by ple_plt_trans, plt_ple_trans/
42 lemma plt_inv_pred_bi (p) (q):
44 /3 width=3 by plt_inv_pred_dx, ple_plt_trans/
47 (* Constructions with ppred *************************************************)
49 lemma plt_unit_sn (q): q = ↑↓q → 𝟏 < q.
52 lemma plt_pred_bi (p) (q): 𝟏 < p → p < q → ↓p < ↓q.
55 <(plt_des_gen … Hp) -Hp
56 <(plt_des_gen … Hpq) //