include "datatypes/constructors.ma".
include "nat/primes.ma".
-include "nat/exp.ma".
(* p is just an upper bound, acc is an accumulator *)
let rec n_divides_aux p n m acc \def
(*
theorem n_divides_to_Prop: \forall n,m,p,a.
match n_divides_aux p n m a with
- [ (pair q r) \Rightarrow n = (exp m a)*r].
+ [ (pair q r) \Rightarrow n = m \sup a *r].
intros.
apply nat_case (mod n m). *)