more notation and one more lemma to prove :(

diff --git a/matita/matita/lib/lambda-delta/notation.ma b/matita/matita/lib/lambda-delta/notation.ma
index 09960abe3facdd73b4759958cf037e5e57af533d..79fcc3a97f6a0fb4c1b068691a15ed52e40b77c1 100644 (file)
--- a/matita/matita/lib/lambda-delta/notation.ma
+++ b/matita/matita/lib/lambda-delta/notation.ma
@@ -61,6 +61,10 @@ notation "hvbox( L ⊢ break ↓ [ d , break e ] break T1 ≡ break T2 )"
 
 (* reduction ****************************************************************)
 
-notation "hvbox( L ⊢ break T1 ⇒ break T2 )"
+notation "hvbox( T1 ⇒ break T2 )"
+   non associative with precedence 45
+   for @{ 'PR $T1 $T2 }.
+
+notation "hvbox( L ⊢ break (term 90 T1) ⇒ break T2 )"
    non associative with precedence 45
    for @{ 'PR $L $T1 $T2 }.

diff --git a/matita/matita/lib/lambda-delta/substitution/lift.ma b/matita/matita/lib/lambda-delta/substitution/lift.ma
index d65f735102af41d3720a96c7e09dc24797f0b8ad..acd84df08b05038921a2a7e9f7c27e5743157285 100644 (file)
--- a/matita/matita/lib/lambda-delta/substitution/lift.ma
+++ b/matita/matita/lib/lambda-delta/substitution/lift.ma
@@ -169,6 +169,8 @@ qed.
 
 (* the main properies *******************************************************)
 
+axiom lift_mono:  ∀d,e,T,U1. ↑[d,e] T ≡ U1 → ∀U2. ↑[d,e] T ≡ U2 → U1 = U2.
+
 theorem lift_conf_rev: ∀d1,e1,T1,T. ↑[d1,e1] T1 ≡ T →
                        ∀d2,e2,T2. ↑[d2 + e1, e2] T2 ≡ T →
                        d1 ≤ d2 →