Theorem: bitvec_AndOrXor_2123___A__B__A__B___A__B (Eval/bitvec_AndOrXor_2123___A__B__A__B___A__B.lean)

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

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