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 set "baseuri" "cic:/matita/RELATIONAL/NLE/fwd".
17 include "logic/connectives.ma".
19 include "NPlus/fwd.ma".
20 include "NLE/defs.ma".
22 theorem nle_inv_succ_1: \forall x,y. x < y \to
23 \exists z. y = succ z \land x <= z.
25 lapply linear nplus_gen_succ_2 to H1.
26 decompose. subst. auto depth = 4.
29 theorem nle_inv_succ_succ: \forall x,y. x < succ y \to x <= y.
31 lapply linear nle_inv_succ_1 to H. decompose.
32 lapply linear eq_gen_succ_succ to H1. subst.
36 theorem nle_inv_succ_zero: \forall x. x < zero \to False.
38 lapply linear nle_inv_succ_1 to H. decompose.
39 lapply linear eq_gen_zero_succ to H1. decompose.
42 theorem nle_inv_zero_2: \forall x. x <= zero \to x = zero.
43 intros 1. elim x; clear x; intros;
45 | lapply linear nle_inv_succ_zero to H1. decompose.
49 theorem nle_inv_succ_2: \forall y,x. x <= succ y \to
50 x = zero \lor \exists z. x = succ z \land z <= y.
51 intros 2; elim x; clear x; intros;
53 | lapply linear nle_inv_succ_succ to H1.