induction k generalizing n i
n k i : Nat
⊢ getBit (n >>> k) i = getBit n (i + k)
case zero
n i : Nat
⊢ getBit (n >>> zero) i = getBit n (i + zero)

case succ
n✝ : Nat
n_ih✝ : ∀ (n i : Nat), getBit (n >>> n✝) i = getBit n (i + n✝)
n i : Nat
⊢ getBit (n >>> succ n✝) i = getBit n (i + succ n✝)