case true =>
  have : ∀ b, f b false = b := by intro b; cases b <;> assumption
  simp [this]
f : Bool → Bool → Bool
f_stable : f false false = false
m : Nat
hm : ¬m = 0
htf : f true false = true
⊢ getBit (if true = true then m else 0) 0 = f (getBit m 0) false
no goals