Complete proof of Bertrand for n >= 256.

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

diff --git a/helm/software/matita/library/nat/nat.ma b/helm/software/matita/library/nat/nat.ma
index b54bc76a9b4b416e80a35d5bb01b48fea9b70f5c..85f598d129a434f7cad878dd9c8a2fc4fdc56077 100644 (file)
--- a/helm/software/matita/library/nat/nat.ma
+++ b/helm/software/matita/library/nat/nat.ma
@@ -12,10 +12,13 @@
 (*                                                                        *)
 (**************************************************************************)
 
-set "baseuri" "cic:/matita/nat/nat".
-
 include "higher_order_defs/functions.ma".
 
+theorem esempio: \forall A,B,C:Prop.(A \to B \to C) \to (A \to B)
+\to A \to C.
+
+
+
 inductive nat : Set \def
   | O : nat
   | S : nat \to nat.