diff options
author | jadep <jade.philipoom@gmail.com> | 2016-10-30 13:56:00 -0400 |
---|---|---|
committer | jadep <jade.philipoom@gmail.com> | 2016-10-30 13:56:11 -0400 |
commit | 373fa5249091ea77605454542ed786ca943a758e (patch) | |
tree | 4b6451b4191bc6ed963e938dae34075d9ba6724c /src/ModularArithmetic | |
parent | e04d8de724984a3a6e2dc98ed3a5a66ea3d067ed (diff) |
remove commented-out lemma
Diffstat (limited to 'src/ModularArithmetic')
-rw-r--r-- | src/ModularArithmetic/ModularBaseSystemProofs.v | 12 |
1 files changed, 1 insertions, 11 deletions
diff --git a/src/ModularArithmetic/ModularBaseSystemProofs.v b/src/ModularArithmetic/ModularBaseSystemProofs.v index ef89cb5ae..f6efdfd87 100644 --- a/src/ModularArithmetic/ModularBaseSystemProofs.v +++ b/src/ModularArithmetic/ModularBaseSystemProofs.v @@ -114,17 +114,7 @@ Section FieldOperationProofs. pose proof c_pos; omega. + apply base_upper_bound_compatible; auto. Qed. -(* - Lemma parity_decode : forall u x, - u ~= x -> Z.odd (F.to_Z x) = Z.odd (nth_default 0 (to_list u) 0). - Proof. - cbv [rep decode] in *. - intros. - rewrite <-H. - cbv [ModularBaseSystemList.decode]. - rewrite F.to_Z_of_Z. - Qed. -*) + Lemma add_rep : forall u v x y, u ~= x -> v ~= y -> add u v ~= (x+y)%F. Proof. |