- we introduced the pointer_step rc in the perspective of proving

[helm.git] / matita / matita / contribs / lambda_delta / basic_2 / grammar / aarity.ma

diff --git a/matita/matita/contribs/lambda_delta/basic_2/grammar/aarity.ma b/matita/matita/contribs/lambda_delta/basic_2/grammar/aarity.ma
index f71f2d62efd49723dbe731bf3c942822e3dcca21..7489da1888424a5f4aca1e60754b06a0bf04b4f3 100644 (file)
--- a/matita/matita/contribs/lambda_delta/basic_2/grammar/aarity.ma
+++ b/matita/matita/contribs/lambda_delta/basic_2/grammar/aarity.ma
@@ -12,13 +12,9 @@
 (*                                                                        *)
 (**************************************************************************)
 
-(* THE FORMAL SYSTEM λδ - MATITA SOURCE FILES
- * Support for abstract candidates of reducibility closed: 2012 January 27
- * Confluence of context-sensitive parallel reduction closed: 2011 September 21
- * Confluence of context-free parallel reduction closed: 2011 September 6
- * Specification started: 2011 April 17
- * - Patience on me to gain peace and perfection! -
- * [ suggested invocation to start formal specifications with ]
+(* THE FORMAL SYSTEM λδ: MATITA SOURCE FILES
+ * Suggested invocation to start formal specifications with:
+ *   - Patience on me to gain peace and perfection! -
  *)
 
 include "ground_2/star.ma".
@@ -39,7 +35,7 @@ interpretation "aarity construction (binary)"
 
 (* Basic inversion lemmas ***************************************************)
 
-lemma discr_apair_xy_x: ∀A,B. ②B. A = B → False.
+lemma discr_apair_xy_x: ∀A,B. ②B. A = B → ⊥.
 #A #B elim B -B
 [ #H destruct
 | #Y #X #IHY #_ #H destruct
@@ -48,7 +44,7 @@ lemma discr_apair_xy_x: ∀A,B. ②B. A = B → False.
 ]
 qed-.
 
-lemma discr_tpair_xy_y: ∀B,A. ②B. A = A → False.
+lemma discr_tpair_xy_y: ∀B,A. ②B. A = A → ⊥.
 #B #A elim A -A
 [ #H destruct
 | #Y #X #_ #IHX #H destruct