Bertrand's conjecture (weak), some work in progress

[helm.git] / helm / software / matita / tests / decl.ma

diff --git a/helm/software/matita/tests/decl.ma b/helm/software/matita/tests/decl.ma
index 4b67f551ab6821646c7bda52a445f646504916b4..5308f9350fa3762f8c496719266481289b274e97 100644 (file)
--- a/helm/software/matita/tests/decl.ma
+++ b/helm/software/matita/tests/decl.ma
@@ -12,7 +12,7 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/tests/decl".
+
 
 include "nat/times.ma".
 include "nat/orders.ma".
@@ -114,11 +114,7 @@ theorem easy3: ∀A:Prop. (A ∧ ∃n:nat.n ≠ n) → True.
  assume P: Prop.
  suppose (P ∧ ∃m:nat.m ≠ m) (H).
  by H we have P (H1) and (∃x:nat.x≠x) (H2).
- (*BUG:
  by H2 let q:nat such that (q ≠ q) (Ineq).
- *)
- (* the next line is wrong, but for the moment it does the job *)
- by H2 let q:nat such that False (Ineq).
  by I done.
 qed.