Theorem: Nat.and_assoc (Extra/Nat/Bitwise.lean)

State before:
x y z : Nat
⊢ x &&& y &&& z = x &&& (y &&& z)
Tactic:
induction x using Nat.recBit generalizing y z <;>
  cases y using Nat.casesBitOn <;> cases z using Nat.casesBitOn <;> simp [*]
State after:
no goals