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

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

diff --git a/helm/software/matita/library/nat/div_and_mod.ma b/helm/software/matita/library/nat/div_and_mod.ma
index 0323b18fb17849949b5ce4a49e3b33476f14fcec..523f7431403a14071e2154d661eb9f22ef552332 100644 (file)
--- a/helm/software/matita/library/nat/div_and_mod.ma
+++ b/helm/software/matita/library/nat/div_and_mod.ma
@@ -223,6 +223,7 @@ apply (div_mod_spec_to_eq2 (q*m+r) m ((q*m+r)/ m) ((q*m+r) \mod m) q r)
   |apply div_mod_spec_intro[assumption|reflexivity]
   ]
 qed.
+
 (* some properties of div and mod *)
 theorem div_times: \forall n,m:nat. ((S n)*m) / (S n) = m.
 intros.
@@ -312,19 +313,6 @@ rewrite > (div_mod ? (S O)) in \vdash (? ? ? %)
   ]
 qed.
 
-theorem le_div: \forall n,m. O < n \to m/n \le m.
-intros.
-rewrite > (div_mod m n) in \vdash (? ? %)
-  [apply (trans_le ? (m/n*n))
-    [rewrite > times_n_SO in \vdash (? % ?).
-     apply le_times
-      [apply le_n|assumption]
-    |apply le_plus_n_r
-    ]
-  |assumption
-  ]
-qed.
-
 theorem or_div_mod: \forall n,q. O < q \to
 ((S (n \mod q)=q) \land S n = (S (div n q)) * q \lor
 ((S (n \mod q)<q) \land S n= (div n q) * q + S (n\mod q))).
@@ -395,6 +383,7 @@ qed.
 variant inj_times_l1:\forall n. O < n \to \forall p,q:nat.p*n = q*n \to p=q
 \def lt_O_to_injective_times_l.
 
+      
 (* n_divides computes the pair (div,mod) *)
 
 (* p is just an upper bound, acc is an accumulator *)