Theorem: bitvec_AndOrXor_2247__A__B__A__B (Eval/bitvec_AndOrXor_2247__A__B__A__B.lean)

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

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