Theorem: Nat.bitwise_idempotent (Algdata/Data/Nat/Bits.lean)

State before:
f : Bool → Bool → Bool
h : ∀ (b : Bool), f b b = b
n : Nat
⊢ bitwise f n n = n
Tactic:
apply Nat.bitext
State after:
case a
f : Bool → Bool → Bool
h : ∀ (b : Bool), f b b = b
n : Nat
⊢ ∀ (i : Nat), getBit (bitwise f n n) i = getBit n i

State before:
case a
f : Bool → Bool → Bool
h : ∀ (b : Bool), f b b = b
n : Nat
⊢ ∀ (i : Nat), getBit (bitwise f n n) i = getBit n i
Tactic:
intro i
State after:
case a
f : Bool → Bool → Bool
h : ∀ (b : Bool), f b b = b
n i : Nat
⊢ getBit (bitwise f n n) i = getBit n i

State before:
case a
f : Bool → Bool → Bool
h : ∀ (b : Bool), f b b = b
n i : Nat
⊢ getBit (bitwise f n n) i = getBit n i
Tactic:
simp [Nat.bitwise_getBit f (h false), h]
State after:
no goals