Theorem: UInt.xor_land (Algdata/Classes/UInt.lean)

State before:
α : Type
inst✝¹ : (n : Nat) → OfNat α n
inst✝ : UInt α
a b c : α
⊢ (a ^^^ b) &&& c = a &&& c ^^^ b &&& c
Tactic:
apply toNat_inj
State after:
case a
α : Type
inst✝¹ : (n : Nat) → OfNat α n
inst✝ : UInt α
a b c : α
⊢ toNat ((a ^^^ b) &&& c) = toNat (a &&& c ^^^ b &&& c)

State before:
case a
α : Type
inst✝¹ : (n : Nat) → OfNat α n
inst✝ : UInt α
a b c : α
⊢ toNat ((a ^^^ b) &&& c) = toNat (a &&& c ^^^ b &&& c)
Tactic:
simp [toNat_land, toNat_xor]
State after:
no goals