Theorem: id_eq_propagate (Lean4bits/lemmas.lean)

State before:
α β α' β' : Type
γ : β → Type
x : ℕ → Bool
⊢ x = propagate Empty.elim (fun x y => (Empty.elim, y ())) fun x_1 => x
Tactic:
ext n
State after:
case h
α β α' β' : Type
γ : β → Type
x : ℕ → Bool
n : ℕ
⊢ x n = propagate Empty.elim (fun x y => (Empty.elim, y ())) (fun x_1 => x) n

State before:
case h
α β α' β' : Type
γ : β → Type
x : ℕ → Bool
n : ℕ
⊢ x n = propagate Empty.elim (fun x y => (Empty.elim, y ())) (fun x_1 => x) n
Tactic:
cases n <;> rfl
State after:
no goals