Complete proof of Bertrand for n >= 256.

[helm.git] / helm / software / matita / library / nat / compare.ma

diff --git a/helm/software/matita/library/nat/compare.ma b/helm/software/matita/library/nat/compare.ma
index 78dc50318197c3dbc449c50d3e757e868aec527d..dd9589e7bfab7d75cf8b33d60c0c60d22e34d259 100644 (file)
--- a/helm/software/matita/library/nat/compare.ma
+++ b/helm/software/matita/library/nat/compare.ma
@@ -12,8 +12,6 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/nat/compare".
-
 include "datatypes/bool.ma".
 include "datatypes/compare.ma".
 include "nat/orders.ma".
@@ -126,6 +124,23 @@ apply nat_elim2; intros; simplify
   ]
 qed.
 
+theorem leb_true_to_le:\forall n,m.
+leb n m = true \to (n \le m).
+intros 2.
+apply leb_elim
+  [intros.assumption
+  |intros.destruct H1.
+  ]
+qed.
+
+theorem leb_false_to_not_le:\forall n,m.
+leb n m = false \to \lnot (n \le m).
+intros 2.
+apply leb_elim
+  [intros.destruct H1
+  |intros.assumption
+  ]
+qed.
 (*
 theorem decidable_le: \forall n,m. n \leq m \lor n \nleq m. 
 intros.