simp [getBit_mod_two_pow, bitwise_getBit f f_stable]
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k i : Nat
⊢ getBit (bitwise f m n % 2 ^ k) i = getBit (bitwise f (m % 2 ^ k) (n % 2 ^ k)) i
case a
f : Bool → Bool → Bool
f_stable : f false false = false
m n k i : Nat
⊢ (decide (i < k) && f (getBit m i) (getBit n i)) = f (decide (i < k) && getBit m i) (decide (i < k) && getBit n i)