c0617da18d
... while at it also call `trivial` to close goals that can be trivially closed. --------- Co-authored-by: Siddharth <siddu.druid@gmail.com> Co-authored-by: Henrik Böving <hargonix@gmail.com>
32 lines
899 B
Text
32 lines
899 B
Text
import Std.Tactic.BVDecide
|
|
|
|
open BitVec
|
|
|
|
set_option bv.ac_nf false
|
|
|
|
theorem bitwise_unit_1 {x y : BitVec 64} : ~~~(x &&& y) = (~~~x ||| ~~~y) := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_1' {x y : BitVec 64} : ~~~(BitVec.and x y) = ((BitVec.not x) ||| ~~~y) := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_2 {x : BitVec 64} : x ^^^ x = 0 := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_2' {x : BitVec 64} : (BitVec.xor x x) = 0 := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_3 {x : BitVec 64} : (x ^^^ x).getLsbD 32 = false := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_4 {x : BitVec 64} : (x ^^^ ~~~x).getLsbD 32 = true := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_5 {x : BitVec 64} : (x ^^^ ~~~x).getLsbD 128 = false := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_6 {x : BitVec 64} : (x ^^^ ~~~x).getLsbD 63 = (x ^^^ ~~~x).msb := by
|
|
bv_decide
|
|
|
|
theorem bitwise_unit_7 (x : BitVec 32) : x ^^^ 123#32 = 123#'(by decide) ^^^ x := by
|
|
bv_decide
|