Hi Kevin
One way to formulate "n is evenly divisible by 5" is "there is a number
k such that k * 5 = n". You could then do:
onlyModByFive : (n : Nat) -> (k : Nat ** 5 * k = n) -> Nat
But it really depends on why you want it only divisible by five, and
what sorts of automation you require. Take a look at the implementations
of divMod in the contrib package for more possibilities.
/David
> --
> You received this message because you are subscribed to the Google
> Groups "Idris Programming Language" group.
> To unsubscribe from this group and stop receiving emails from it, send
> an email to
idris-lang+...@googlegroups.com
> <mailto:
idris-lang+...@googlegroups.com>.
> For more options, visit
https://groups.google.com/d/optout.