X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Fcontribs%2FLAMBDA-TYPES%2FUnified-Sub%2FLift%2Finv.ma;h=87b7bdc8c1a1241d7e4547f6c0f040452f6980c1;hb=49e72b6a1c126e7e34323b64decad10d46d93f97;hp=3a48e5987353aeff75e5ecf626b95bf92c723ec7;hpb=b54b2b352753b1c784d06118fc689c1ee9f9feaf;p=helm.git

diff --git a/helm/software/matita/contribs/LAMBDA-TYPES/Unified-Sub/Lift/inv.ma b/helm/software/matita/contribs/LAMBDA-TYPES/Unified-Sub/Lift/inv.ma
index 3a48e5987..87b7bdc8c 100644
--- a/helm/software/matita/contribs/LAMBDA-TYPES/Unified-Sub/Lift/inv.ma
+++ b/helm/software/matita/contribs/LAMBDA-TYPES/Unified-Sub/Lift/inv.ma
@@ -21,7 +21,7 @@ include "Lift/defs.ma".
 theorem lift_inv_sort_1: \forall l, i, h, x.
                          Lift l i (sort h) x \to
                          x = sort h.
- intros. inversion H; clear H; intros; subst. auto.
+ intros. inversion H; clear H; intros; subst. autobatch.
 qed.
 
 theorem lift_inv_lref_1: \forall l, i, j1, x.
@@ -30,7 +30,7 @@ theorem lift_inv_lref_1: \forall l, i, j1, x.
                          (i <= j1 \land 
                           \exists j2. (l + j1 == j2) \land x = lref j2
                          ).
- intros. inversion H; clear H; intros; subst; auto depth = 5.
+ intros. inversion H; clear H; intros; subst; autobatch depth = 5 size = 7.
 qed.
 
 theorem lift_inv_bind_1: \forall l, i, r, u1, t1, x.
@@ -39,7 +39,7 @@ theorem lift_inv_bind_1: \forall l, i, r, u1, t1, x.
                          Lift l i u1 u2 \land
                          Lift l (succ i) t1 t2 \land
                          x = intb r u2 t2.
- intros. inversion H; clear H; intros; subst. auto depth = 5.
+ intros. inversion H; clear H; intros; subst; autobatch depth = 5 size = 7.
 qed.
 
 theorem lift_inv_flat_1: \forall l, i, r, u1, t1, x.
@@ -48,13 +48,13 @@ theorem lift_inv_flat_1: \forall l, i, r, u1, t1, x.
                          Lift l i u1 u2 \land
                          Lift l i t1 t2 \land
                          x = intf r u2 t2.
- intros. inversion H; clear H; intros; subst. auto depth = 5.
+ intros. inversion H; clear H; intros; subst. autobatch depth = 5 size = 7.
 qed.
 
 theorem lift_inv_sort_2: \forall l, i, x, h.
                          Lift l i x (sort h) \to
                          x = sort h.
- intros. inversion H; clear H; intros; subst. auto.
+ intros. inversion H; clear H; intros; subst. autobatch.
 qed.
 
 theorem lift_inv_lref_2: \forall l, i, x, j2.
@@ -63,7 +63,7 @@ theorem lift_inv_lref_2: \forall l, i, x, j2.
                          (i <= j2 \land 
                           \exists j1. (l + j1 == j2) \land x = lref j1
                          ).
- intros. inversion H; clear H; intros; subst; auto depth = 5.
+ intros. inversion H; clear H; intros; subst; autobatch depth = 5 size = 10.
 qed.
 
 theorem lift_inv_bind_2: \forall l, i, r, x, u2, t2.
@@ -72,7 +72,7 @@ theorem lift_inv_bind_2: \forall l, i, r, x, u2, t2.
                          Lift l i u1 u2 \land
                          Lift l (succ i) t1 t2 \land
                          x = intb r u1 t1.
- intros. inversion H; clear H; intros; subst. auto depth = 5.
+ intros. inversion H; clear H; intros; subst. autobatch depth = 5 size = 7.
 qed.
 
 theorem lift_inv_flat_2: \forall l, i, r, x, u2, t2.
@@ -81,7 +81,7 @@ theorem lift_inv_flat_2: \forall l, i, r, x, u2, t2.
                          Lift l i u1 u2 \land
                          Lift l i t1 t2 \land
                          x = intf r u1 t1.
- intros. inversion H; clear H; intros; subst. auto depth = 5.
+ intros. inversion H; clear H; intros; subst. autobatch depth = 5 size = 7.
 qed.
 
 (* Corollaries of inversion properties ***************************************)
@@ -91,7 +91,7 @@ theorem lift_inv_lref_1_gt: \forall l, i, j1, x.
                             i > j1 \to x = lref j1.
  intros.
  lapply linear lift_inv_lref_1 to H. decompose; subst;
- [ auto
+ [ autobatch
  | lapply linear nle_false to H2, H1. decompose
  ].
 qed.
@@ -102,7 +102,7 @@ theorem lift_inv_lref_1_le: \forall l, i, j1, x.
  intros.
  lapply linear lift_inv_lref_1 to H. decompose; subst;
  [ lapply linear nle_false to H1, H2. decompose
- | auto
+ | autobatch
  ].
 qed.
 
@@ -113,7 +113,7 @@ theorem lift_inv_lref_1_le_nplus: \forall l, i, j1, x.
  intros.
  lapply linear lift_inv_lref_1 to H. decompose; subst;
  [ lapply linear nle_false to H1, H3. decompose
- | lapply linear nplus_mono to H2, H4. subst. auto
+ | lapply linear nplus_mono to H2, H4. subst. autobatch
  ].
 qed.
 
@@ -122,7 +122,7 @@ theorem lift_inv_lref_2_gt: \forall l, i, x, j2.
                             i > j2 \to x = lref j2.
  intros.
  lapply linear lift_inv_lref_2 to H. decompose; subst;
- [ auto
+ [ autobatch
  | lapply linear nle_false to H2, H1. decompose
  ].
  qed.
@@ -133,7 +133,7 @@ theorem lift_inv_lref_2_le: \forall l, i, x, j2.
  intros.
  lapply linear lift_inv_lref_2 to H. decompose; subst;
  [ lapply linear nle_false to H1, H2. decompose
- | auto
+ | autobatch
  ].
 qed.
 
@@ -144,6 +144,6 @@ theorem lift_inv_lref_2_le_nplus: \forall l, i, x, j2.
  intros.
  lapply linear lift_inv_lref_2 to H. decompose; subst;
  [ lapply linear nle_false to H1, H3. decompose
- | lapply linear nplus_inj_2 to H2, H4. subst. auto
+ | lapply linear nplus_inj_2 to H2, H4. subst. autobatch
  ].
 qed.