Commit 2891ec49 authored by François Bobot's avatar François Bobot

[Coq] Remove a SearchAbout

parent 4ba8aea9
......@@ -64,7 +64,6 @@ Lemma cmod_cases : forall (n:Z) (d:Z), ((0%Z <= n)%Z -> ((0%Z < d)%Z ->
intros n d.
unfold int.EuclideanDivision.mod1.
SearchAbout Z.rem Z.quot.
assert (Z.rem n d = n - (d * (Z.quot n d)))%Z.
assert (H:= Z.quot_rem' n d).
Markdown is supported
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment