First proof finished (some tactics still not working).

[helm.git] / helm / software / matita / nlibrary / logic / equality.ma

diff --git a/helm/software/matita/nlibrary/logic/equality.ma b/helm/software/matita/nlibrary/logic/equality.ma
index ff8cc5a1392c5393d997f2f85dd0da48e8397942..2418f2a7c504da2a7f8b68957604c30ad224a4be 100644 (file)
--- a/helm/software/matita/nlibrary/logic/equality.ma
+++ b/helm/software/matita/nlibrary/logic/equality.ma
@@ -16,6 +16,11 @@ include "logic/connectives.ma".
 
 ninductive eq (A: Type) (a: A) : A → CProp ≝
  refl: eq A a a.
+
+nlet rec eq_rect (A: Type) (x: A) (P: ∀y:A. eq A x y → CProp) (q: P x (refl A x))
+ (y: A) (p: eq A x y) on p : P y p ≝
+ match p with
+  [ refl ⇒ q ].
  
 interpretation "leibnitz's equality" 'eq t x y = (eq t x y).