(* Basic eliminators ********************************************************)
-lemma ltpss_ind: ∀d,e,L1. ∀R: lenv → Prop. R L1 →
+lemma ltpss_ind: ∀d,e,L1. ∀R:predicate lenv. R L1 →
(∀L,L2. L1 [d, e] ≫* L → L [d, e] ≫ L2 → R L → R L2) →
∀L2. L1 [d, e] ≫* L2 → R L2.
#d #e #L1 #R #HL1 #IHL1 #L2 #HL12 @(TC_star_ind … HL1 IHL1 … HL12) //
lemma ltpss_strap: ∀L1,L,L2,d,e.
L1 [d, e] ≫ L → L [d, e] ≫* L2 → L1 [d, e] ≫* L2.
-/2/ qed.
+/2 width=3/ qed.
lemma ltpss_refl: ∀L,d,e. L [d, e] ≫* L.
-/2/ qed.
+/2 width=1/ qed.
(* Basic inversion lemmas ***************************************************)
lemma ltpss_inv_atom1: ∀d,e,L2. ⋆ [d, e] ≫* L2 → L2 = ⋆.
#d #e #L2 #H @(ltpss_ind … H) -L2 //
-#L #L2 #_ #HL2 #IHL destruct -L
+#L #L2 #_ #HL2 #IHL destruct
>(ltps_inv_atom1 … HL2) -HL2 //
qed-.
-fact ltpss_inv_atom2_aux: ∀d,e,L1,L2.
- L1 [d, e] ≫* L2 → L2 = ⋆ → L1 = ⋆.
+fact ltpss_inv_atom2_aux: ∀d,e,L1,L2. L1 [d, e] ≫* L2 → L2 = ⋆ → L1 = ⋆.
#d #e #L1 #L2 #H @(ltpss_ind … H) -L2 //
-#L2 #L #_ #HL2 #IHL2 #H destruct -L;
-lapply (ltps_inv_atom2 … HL2) -HL2 /2/
+#L2 #L #_ #HL2 #IHL2 #H destruct
+lapply (ltps_inv_atom2 … HL2) -HL2 /2 width=1/
qed.
lemma ltpss_inv_atom2: ∀d,e,L1. L1 [d, e] ≫* ⋆ → L1 = ⋆.
#d #e #L1 #L2 * -d e L1 L2
[ #d #e #_ #_ #K1 #I #V1 #H destruct
| #L1 #I #V #_ #H elim (lt_refl_false … H)
-| #L1 #L2 #I #V1 #V2 #e #HL12 #HV12 #_ #_ #K2 #J #W2 #H destruct -L2 I V2 /2 width=5/
+| #L1 #L2 #I #V1 #V2 #e #HL12 #HV12 #_ #_ #K2 #J #W2 #H destruct /2 width=5/
| #L1 #L2 #I #V1 #V2 #d #e #_ #_ #H elim (plus_S_eq_O_false … H)
]
qed.
[ #d #e #_ #I #K2 #V2 #H destruct
| #L #I #V #H elim (lt_refl_false … H)
| #L1 #L2 #I #V1 #V2 #e #_ #_ #H elim (lt_refl_false … H)
-| #L1 #L2 #I #V1 #V2 #d #e #HL12 #HV12 #_ #J #K2 #W2 #H destruct -L2 I V2
- /2 width=5/
+| #L1 #L2 #I #V1 #V2 #d #e #HL12 #HV12 #_ #J #K2 #W2 #H destruct /2 width=5/
]
qed.
∃∃K1,V1. K1 [d - 1, e] ≫ K2 &
K2 ⊢ V1 [d - 1, e] ≫ V2 &
L1 = K1. 𝕓{I} V1.
-/2/ qed.
+/2 width=1/ qed.
*)