X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fmatita%2Flibrary%2Fdatatypes%2Fconstructors.ma;h=92b27d64e904d543b696040a750419a701a29997;hb=e880d6eab5e1700f4a625ddcd7d0fa8f0cce2dcc;hp=dd2a1760b9c640c7853fafbeb33babe2d7670ad2;hpb=b715c8a42bd126e4b11b8b72451d6497ce1f7f73;p=helm.git

diff --git a/helm/software/matita/library/datatypes/constructors.ma b/helm/software/matita/library/datatypes/constructors.ma
index dd2a1760b..92b27d64e 100644
--- a/helm/software/matita/library/datatypes/constructors.ma
+++ b/helm/software/matita/library/datatypes/constructors.ma
@@ -12,7 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/datatypes/constructors/".
 include "logic/equality.ma".
 
 inductive void : Set \def.
@@ -22,17 +21,9 @@ inductive unit : Set ≝ something: unit.
 inductive Prod (A,B:Type) : Type \def
 pair : A \to B \to Prod A B.
 
-interpretation "Pair construction" 'pair x y =
- (cic:/matita/datatypes/constructors/Prod.ind#xpointer(1/1/1) _ _ x y).
+interpretation "Pair construction" 'pair x y = (pair ? ? x y).
 
-notation "hvbox(\langle x break , y \rangle )" with precedence 89
-for @{ 'pair $x $y}.
-
-interpretation "Product" 'product x y =
- (cic:/matita/datatypes/constructors/Prod.ind#xpointer(1/1) x y).
-
-notation "hvbox(x break \times y)" with precedence 89
-for @{ 'product $x $y}.
+interpretation "Product" 'product x y = (Prod x y).
 
 definition fst \def \lambda A,B:Type.\lambda p: Prod A B.
 match p with
@@ -42,20 +33,15 @@ definition snd \def \lambda A,B:Type.\lambda p: Prod A B.
 match p with
 [(pair a b) \Rightarrow b].
 
-interpretation "First projection" 'fst x =
- (cic:/matita/datatypes/constructors/fst.con _ _ x).
-
-notation "\fst x" with precedence 89
-for @{ 'fst $x}.
-
-interpretation "Second projection" 'snd x =
- (cic:/matita/datatypes/constructors/snd.con _ _ x).
-
-notation "\snd x" with precedence 89
-for @{ 'snd $x}.
+interpretation "pair pi1" 'pi1 = (fst ? ?).
+interpretation "pair pi2" 'pi2 = (snd ? ?).
+interpretation "pair pi1" 'pi1a x = (fst ? ? x).
+interpretation "pair pi2" 'pi2a x = (snd ? ? x).
+interpretation "pair pi1" 'pi1b x y = (fst ? ? x y).
+interpretation "pair pi2" 'pi2b x y = (snd ? ? x y).
 
 theorem eq_pair_fst_snd: \forall A,B:Type.\forall p:Prod A B.
-p = 〈 (\fst p), (\snd p) 〉.
+p = 〈 \fst p, \snd p 〉.
 intros.elim p.simplify.reflexivity.
 qed.
 
@@ -63,9 +49,8 @@ inductive Sum (A,B:Type) : Type \def
   inl : A \to Sum A B
 | inr : B \to Sum A B.
 
-interpretation "Disjoint union" 'plus A B =
- (cic:/matita/datatypes/constructors/Sum.ind#xpointer(1/1) A B).
+interpretation "Disjoint union" 'plus A B = (Sum A B).
 
 inductive option (A:Type) : Type ≝
    None : option A
- | Some : A → option A.
\ No newline at end of file
+ | Some : A → option A.