How do you prove: forall m n : Z, m < n -> m -n < O in Coq? Many Thanks!
How do you prove: forall m n : Z, m < n -> m
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If you just care about proving it, and not about the proof, just use omega:
If you have to prove this as part of exercises, or a homework, it is not too hard if you rely on some existing proofs.
For instance, you can combine these guys:
There are definitely more than one way to do it, and it is not a very hard goal if you use some existing lemmas.