Empty types not in Prop and empty types elimination handled correctly.

[helm.git] / matita / tests / tinycals.ma

diff --git a/matita/tests/tinycals.ma b/matita/tests/tinycals.ma
index 5cd2548a8b9d8ea3e4f0a137ec9cf1c2d2929fd5..465d7c06e0953702c2b23104c18493e457eae183 100644 (file)
--- a/matita/tests/tinycals.ma
+++ b/matita/tests/tinycals.ma
@@ -12,16 +12,18 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/test/tinycals".
+set "baseuri" "cic:/matita/tests/tinycals".
 
 theorem prova: 
-  \forall A,B:Prop.
-  \forall H:A \to A \to A \to A \to A \to B.A \to B.
+  \forall A,B,C:Prop.
+  \forall H:A \to A \to C \to A \to A \to B.A \to C \to B.
 intros.
 apply H;
   [assumption 
-  |3,5:assumption;
-  4:assumption
+  |3,5:
+   [ exact H2;
+   | exact H1 ]
+  |4:assumption
   |*:assumption
   ]
 qed.
@@ -31,19 +33,21 @@ theorem prova1:
   \forall H:A \to A \to A \to A \to A \to B.A \to B.
 intros.
 apply H;
-  [*:assumption
-  ]
+  [*:assumption]
 qed. 
 
+include "logic/connectives.ma".
+
 theorem prova2: 
   \forall A,B:Prop.
-  \forall H:A \to A \to A \to A \to A \to B.A \to B.
+  \forall H:A \to A \to A \to (A \land A) \to A \to B.A \to B.
 intros.
 apply H;
   [2:assumption
-   |assumption
-   3,5:assumption
-   *:assumption
+  |4:split.assumption
+  |3,5:assumption
+  |*:assumption
   ]
+assumption.
 qed.