Theorem: bitvec_AndOrXor_1288_A__B__B__C__A___A__B__C (Eval/bitvec_AndOrXor_1288_A__B__B__C__A___A__B__C.lean)

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

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