(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.
qed.
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.
qed.
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.
qed.
theorem lift_inv_sort_2: \forall l, i, x, h.
(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.
qed.
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.
qed.
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.
qed.
(* Corollaries of inversion properties ***************************************)
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.
intros.
lapply linear lift_inv_lref_1 to H. decompose; subst;
[ lapply linear nle_false to H1, H2. decompose
- | auto
+ | autobatch
].
qed.
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.
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.
intros.
lapply linear lift_inv_lref_2 to H. decompose; subst;
[ lapply linear nle_false to H1, H2. decompose
- | auto
+ | autobatch
].
qed.
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.