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).
-interpretation "Product" 'product x y =
- (cic:/matita/datatypes/constructors/Prod.ind#xpointer(1/1) 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
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