induction i generalizing n k
n k i : Nat
h : i < k
⊢ getBit (n <<< k) i = false
case zero
n k : Nat
h : zero < k
⊢ getBit (n <<< k) zero = false

case succ
n✝ : Nat
n_ih✝ : ∀ (n k : Nat), n✝ < k → getBit (n <<< k) n✝ = false
n k : Nat
h : succ n✝ < k
⊢ getBit (n <<< k) (succ n✝) = false