diff options
| author | Chantal Keller <Chantal.Keller@inria.fr> | 2020-06-30 16:09:52 +0200 |
|---|---|---|
| committer | Chantal Keller <Chantal.Keller@inria.fr> | 2020-06-30 16:09:52 +0200 |
| commit | fa287eec3d57135ed1bd9285be0bc600449b13c1 (patch) | |
| tree | 296360e97e48df25a229dc3751a72c1634ffc8b3 | |
| parent | dbbdbff6f25c9f4cc9a7203d7e038bbbb549f7b1 (diff) | |
| download | smtcoq-fa287eec3d57135ed1bd9285be0bc600449b13c1.tar.gz smtcoq-fa287eec3d57135ed1bd9285be0bc600449b13c1.zip | |
Remove unused axiom
| -rw-r--r-- | src/bva/Bva_checker.v | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/src/bva/Bva_checker.v b/src/bva/Bva_checker.v index 180fbcf..eebf5f9 100644 --- a/src/bva/Bva_checker.v +++ b/src/bva/Bva_checker.v @@ -1926,10 +1926,6 @@ Qed. Lemma eq_head: forall {A: Type} a b (l: list A), (a :: l) = (b :: l) <-> a = b. Proof. intros A a b l; split; [intros H; inversion H|intros ->]; auto. Qed. - Axiom afold_left_xor : forall a, - afold_left bool int false xorb (Lit.interp rho) a = - C.interp rho (to_list a). - Lemma eqb_spec : forall x y, (x == y) = true <-> x = y. Proof. split;auto using eqb_correct, eqb_complete. |