Theorem: bitvec_AndOrXor_2297 (Eval/bitvec_AndOrXor_2297.lean)

State before:
⊢ ∀ (A B : BitVec 64), A &&& B ||| A ^^^ -1 ^^^ B = A ^^^ -1 ^^^ B
Tactic:
intros
State after:
A✝ B✝ : BitVec 64
⊢ A✝ &&& B✝ ||| A✝ ^^^ -1 ^^^ B✝ = A✝ ^^^ -1 ^^^ B✝

State before:
A✝ B✝ : BitVec 64
⊢ A✝ &&& B✝ ||| A✝ ^^^ -1 ^^^ B✝ = A✝ ^^^ -1 ^^^ B✝
Tactic:
bv_decide
State after:
no goals