Question: 2. (20 %) Prove the following two lemmas using Coq. (Hint: for constructing the proofs, most needed lemmas may be found in the ZArith.BinInt library.)

2. (20 %) Prove the following two lemmas using Coq. (Hint: for constructing the proofs, most needed lemmas may be found in the ZArith.BinInt library.) Require Import ZArith. Open Scope Z_scope. Lemma div_minus_1: forall a b c: Z, (b > c) -> (a 1 (b - c)) -> (a | c) -> (a | b). Lemma div_minus_r: forall a b c: Z, (a | b) -> (a | c) -> (b > c) -> (a | (b - c))
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
