match n with
| 0 => exact absurd (hb rfl) Bool.noConfusion
| n+1 => simpa [← Nat.add_assoc, Nat.add_right_comm _ 1, ← Nat.two_mul] using e _
case f.false
C : ℕ → Sort u
z : C 0
o : (n : ℕ) → C (2 * n + 1)
e : (n : ℕ) → C (2 * n + 2)
n : ℕ
hb : n = 0 → false = true
a✝ : bit false n = n → C (bit false n)
⊢ C (bit false n)
no goals