Theorem: Matrix.constant_eq_vec₂ (Logic/Vorspiel/Vorspiel.lean)

State before:
n : ℕ
α : Type u
a : α
⊢ (fun x => a) = ![a, a]
Tactic:
funext x
State after:
case h
n : ℕ
α : Type u
a : α
x : Fin (Nat.succ 0).succ
⊢ a = ![a, a] x

State before:
case h
n : ℕ
α : Type u
a : α
x : Fin (Nat.succ 0).succ
⊢ a = ![a, a] x
Tactic:
cases x using Fin.cases <;> simp[Fin.eq_zero]
State after:
no goals