case false =>
  simp [h_ind]
  intro h
  have : i ≠ n := λ hcontra => by cases (hbit ▸ hcontra ▸ h)
  constructor
  . exact Nat.lt_succ_of_lt
  . intro hle; exact Nat.lt_of_le_of_ne (Nat.le_of_lt_succ hle) ‹i≠n›
α : Type
inst✝¹ : (n : Nat) → OfNat α n
inst✝ : UInt α
a : α
i n : Nat
h_ind : i ∈ bitIndices.aux a n ↔ i < n ∧ UInt.getBit a i = true
hbit : UInt.getBit a n = false
⊢ (i ∈ if false = true then n :: bitIndices.aux a n else bitIndices.aux a n) ↔ i < Nat.succ n ∧ UInt.getBit a i = true
no goals