diff options
| author |  Jason Gross <jgross@mit.edu> | 2017-04-04 14:35:43 -0400 |
|---|---|---|
| committer |  Jason Gross <jasongross9@gmail.com> | 2017-04-04 16:05:55 -0400 |
| commit | 331fe3fcfb27d87dcfb0585ced3c051f19aaedf2 (patch) | |
| tree | a9af1a7f8bba3fb1f6e7d1610ca1553f5e5f23c2 /src/Encoding/ModularWordEncodingPre.v | |
| parent | 6cba3c4e0572e9d917d3578c39f4f85cd3799b54 (diff) | |
Add [Proof using] to most proofs
This closes #146 and makes `make quick` faster.
The changes were generated by adding [Global Set Suggest Proof Using.]
to GlobalSettings.v, and then following [the instructions for a script I
wrote](https://github.com/JasonGross/coq-tools#proof-using-helper).
Diffstat (limited to 'src/Encoding/ModularWordEncodingPre.v')
| -rw-r--r-- | src/Encoding/ModularWordEncodingPre.v | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/Encoding/ModularWordEncodingPre.v b/src/Encoding/ModularWordEncodingPre.v index faf4eecc5..874bfdc9d 100644 --- a/src/Encoding/ModularWordEncodingPre.v +++ b/src/Encoding/ModularWordEncodingPre.v @@ -21,7 +21,7 @@ Section ModularWordEncodingPre. . Lemma Fm_encoding_valid : forall x, Fm_dec (Fm_enc x) = Some x. - Proof. + Proof using bound_check m_pos. unfold Fm_dec, Fm_enc; intros. pose proof (F.to_Z_range x m_pos). rewrite wordToN_NToWord_idempotent by (apply bound_check_nat_N; @@ -32,7 +32,7 @@ Section ModularWordEncodingPre. Qed. Lemma Fm_encoding_canonical : forall w x, Fm_dec w = Some x -> Fm_enc x = w. - Proof. + Proof using bound_check. unfold Fm_dec, Fm_enc; intros ? ? dec_Some. break_if; [ | congruence ]. inversion dec_Some. |