A first example that uses a status monad where the status is a tree.

[helm.git] / matita / matita / contribs / lambdadelta / basic_2 / reduction / cix_append.ma

diff --git a/matita/matita/contribs/lambdadelta/basic_2/reduction/cix_append.ma b/matita/matita/contribs/lambdadelta/basic_2/reduction/cix_append.ma
index 3e1d06076ce043f9bd50b49251b7a1953439ec5e..7702f384fc92cb2edfda2e7703f4de030a75b510 100644 (file)
--- a/matita/matita/contribs/lambdadelta/basic_2/reduction/cix_append.ma
+++ b/matita/matita/contribs/lambdadelta/basic_2/reduction/cix_append.ma
@@ -19,8 +19,8 @@ include "basic_2/reduction/cix.ma".
 
 (* Advanced inversion lemmas ************************************************)
 
-lemma cix_inv_append_sn: ∀h,g,L,K,T. ⦃h, K @@ L⦄ ⊢ 𝐈[g]⦃T⦄  → ⦃h, L⦄ ⊢ 𝐈[g]⦃T⦄.
+lemma cix_inv_append_sn: ∀h,g,G,L,K,T. ⦃G, K @@ L⦄ ⊢ 𝐈[h, g]⦃T⦄  → ⦃G, L⦄ ⊢ 𝐈[h, g]⦃T⦄.
 /3 width=1/ qed-.
 
-lemma cix_inv_tix: ∀h,g,L,T. ⦃h, L⦄ ⊢ 𝐈[g]⦃T⦄  → ⦃h, ⋆⦄ ⊢ 𝐈[g]⦃T⦄.
+lemma cix_inv_tix: ∀h,g,G,L,T. ⦃G, L⦄ ⊢ 𝐈[h, g]⦃T⦄  → ⦃G, ⋆⦄ ⊢ 𝐈[h, g]⦃T⦄.
 /3 width=1/ qed-.