update in delayed_updating

[helm.git] / matita / matita / contribs / lambdadelta / delayed_updating / unwind / unwind2_prototerm_lift.ma

diff --git a/matita/matita/contribs/lambdadelta/delayed_updating/unwind/unwind2_prototerm_lift.ma b/matita/matita/contribs/lambdadelta/delayed_updating/unwind/unwind2_prototerm_lift.ma
deleted file mode 100644 (file)
index 251d7ba..0000000
--- a/matita/matita/contribs/lambdadelta/delayed_updating/unwind/unwind2_prototerm_lift.ma
+++ /dev/null
@@ -1,39 +0,0 @@
-(**************************************************************************)
-(*       ___                                                              *)
-(*      ||M||                                                             *)
-(*      ||A||       A project by Andrea Asperti                           *)
-(*      ||T||                                                             *)
-(*      ||I||       Developers:                                           *)
-(*      ||T||         The HELM team.                                      *)
-(*      ||A||         http://helm.cs.unibo.it                             *)
-(*      \   /                                                             *)
-(*       \ /        This file is distributed under the terms of the       *)
-(*        v         GNU General Public License Version 2                  *)
-(*                                                                        *)
-(**************************************************************************)
-
-(**) (* reverse include *)
-include "ground/lib/subset_ext_equivalence.ma".
-include "delayed_updating/substitution/lift_prototerm.ma".
-include "delayed_updating/unwind/unwind2_path_lift.ma".
-include "delayed_updating/unwind/unwind2_prototerm.ma".
-
-(* TAILED UNWIND FOR PROTOTERM **********************************************)
-
-(* Constructions with lift_prototerm ****************************************)
-
-lemma lift_unwind2_term_after (f1) (f2) (t):
-      🠡[f2]▼[f1]t ⇔ ▼[f2∘f1]t.
-#f1 #f2 #t @subset_eq_trans
-[| @subset_inclusion_ext_f1_compose ]
-@subset_equivalence_ext_f1_exteq #p
-@lift_unwind2_path_after
-qed.
-
-lemma unwind2_lift_term_after (f1) (f2) (t):
-      ▼[f2]🠡[f1]t ⇔ ▼[f2∘f1]t.
-#f1 #f2 #t @subset_eq_trans
-[| @subset_inclusion_ext_f1_compose ]
-@subset_equivalence_ext_f1_exteq #p
-@unwind2_lift_path_after
-qed.