notation factored, coercion commant taking terms and not only URI

[helm.git] / helm / software / matita / library / demo / realisability.ma

diff --git a/helm/software/matita/library/demo/realisability.ma b/helm/software/matita/library/demo/realisability.ma
index 0cd58c63dce78b1c70fe0640541c2d405c73621e..d1b569c4075ddc7abf362856eb683840b8e35d74 100644 (file)
--- a/helm/software/matita/library/demo/realisability.ma
+++ b/helm/software/matita/library/demo/realisability.ma
@@ -12,8 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/demo/realisability/".
-
 include "logic/connectives.ma".
 include "datatypes/constructors.ma".
 
@@ -59,7 +57,7 @@ definition pi2 ≝
   match s return λs.P (pi1 ? ? s) with
    [ sigma_intro _ p ⇒ p].
 
-notation "hvbox(Σ ident i opt (: ty) break . p)"
+notation "hvbox(\Sigma ident i opt (: ty) break . p)"
   right associative with precedence 20
 for @{ 'sigma ${default
   @{\lambda ${ident i} : $ty. $p}
@@ -116,9 +114,8 @@ theorem correct: ∀F:SP.∀r:type_OF_SP F.modr F r → Prop_OF_SP F.
        | apply (proj2 ? ? H2)
        ]
      ]
-  | generalize in match H2; clear H2;
-    change in r with (type_OF_SP s + type_OF_SP s1);
-    elim r; simplify in H2;
+  | change in r with (type_OF_SP s + type_OF_SP s1);
+    elim r in H2 ⊢ %; simplify in H2;
      [ left; apply H; assumption
      | right; apply H1; assumption
      ]
@@ -131,8 +128,7 @@ theorem correct: ∀F:SP.∀r:type_OF_SP F.modr F r → Prop_OF_SP F.
     | skip
     ]
   | simplify in r;
-    generalize in match H1; clear H1;
-    elim r;
+    elim r in H1 ⊢ %;
     apply (ex_intro ? ? a);
     apply H;
     assumption