X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fcontribs%2FRELATIONAL%2FNLE%2Ffwd.ma;h=06b7c6fefbba15e75e0c043e73c98c2df18ac769;hb=ac7831c825d6c3227053f3e339a53b10e3e7118f;hp=6a78e0aac788bce7a77661c3bc93b213fec70b3b;hpb=45d71beffd253ffd767a9afbfcec5c4f44afd8a8;p=helm.git

diff --git a/matita/contribs/RELATIONAL/NLE/fwd.ma b/matita/contribs/RELATIONAL/NLE/fwd.ma
index 6a78e0aac..06b7c6fef 100644
--- a/matita/contribs/RELATIONAL/NLE/fwd.ma
+++ b/matita/contribs/RELATIONAL/NLE/fwd.ma
@@ -16,46 +16,41 @@ set "baseuri" "cic:/matita/RELATIONAL/NLE/fwd".
 
 include "logic/connectives.ma".
 
-include "Nat/fwd.ma". 
+include "NPlus/fwd.ma".
 include "NLE/defs.ma".
 
-theorem nle_gen_succ_1: \forall x,y. x < y \to 
-                        \exists z. y = succ z \land x <= z.
- intros. inversion H; clear H; intros;
- [ apply (eq_gen_succ_zero ? ? H)
- | lapply linear eq_gen_succ_succ to H2 as H0.
-   subst.
-   apply ex_intro; [|auto] (**)
- ].
+theorem nle_inv_succ_1: \forall x,y. x < y \to 
+                         \exists z. y = succ z \land x <= z.
+ intros. elim H.
+ lapply linear nplus_gen_succ_2 to H1.
+ decompose. subst. auto depth = 4.
 qed.
 
-theorem nle_gen_succ_succ: \forall x,y. x < succ y \to x <= y.
- intros; inversion H; clear H; intros;
- [ apply (eq_gen_succ_zero ? ? H)
- | lapply linear eq_gen_succ_succ to H2 as H0.
-   lapply linear eq_gen_succ_succ to H3 as H2.
-   subst. auto
- ].
+theorem nle_inv_succ_succ: \forall x,y. x < succ y \to x <= y.
+ intros.
+ lapply linear nle_inv_succ_1 to H. decompose.
+ lapply linear eq_gen_succ_succ to H1. subst.
+ auto.
 qed.
 
-theorem nle_gen_succ_zero: \forall (P:Prop). \forall x. x < zero \to P.
+theorem nle_inv_succ_zero: \forall x. x < zero \to False.
  intros.
- lapply linear nle_gen_succ_1 to H. decompose.
- apply (eq_gen_zero_succ ? ? H1).
+ lapply linear nle_inv_succ_1 to H. decompose.
+ lapply linear eq_gen_zero_succ to H1. decompose.
 qed.
 
-theorem nle_gen_zero_2: \forall x. x <= zero \to x = zero.
+theorem nle_inv_zero_2: \forall x. x <= zero \to x = zero.
  intros 1. elim x; clear x; intros;
  [ auto
- | apply (nle_gen_succ_zero ? ? H1)
+ | lapply linear nle_inv_succ_zero to H1. decompose.
  ].
 qed.
 
-theorem nle_gen_succ_2: \forall y,x. x <= succ y \to
+theorem nle_inv_succ_2: \forall y,x. x <= succ y \to
                         x = zero \lor \exists z. x = succ z \land z <= y.
  intros 2; elim x; clear x; intros;
  [ auto
- | lapply linear nle_gen_succ_succ to H1.
-   right. apply ex_intro; [|auto] (**)
+ | lapply linear nle_inv_succ_succ to H1.
+   auto depth = 4.
  ].
 qed.