p = 〈 \fst p, \snd p 〉.
#A #B #p (cases p) // qed.
+lemma fst_eq : ∀A,B.∀a:A.∀b:B. \fst 〈a,b〉 = a.
+// qed.
+
+lemma snd_eq : ∀A,B.∀a:A.∀b:B. \snd 〈a,b〉 = b.
+// qed.
+
(* sum *)
inductive Sum (A,B:Type[0]) : Type[0] ≝
inl : A → Sum A B
(* sigma *)
inductive Sig (A:Type[0]) (f:A→Type[0]) : Type[0] ≝
- dp: ∀a:A.(f a)→Sig A f.
\ No newline at end of file
+ dp: ∀a:A.(f a)→Sig A f.
+
+interpretation "Sigma" 'sigma x = (Sig ? x).