English
For a: Fin m → α and b: Fin n → α, List.ofFn (Fin.append a b) = List.ofFn a ++ List.ofFn b.
Русский
Для a: Fin m → α и b: Fin n → α, List.ofFn (Fin.append a b) = List.ofFn a + List.ofFn b.
LaTeX
$$$ \\operatorname{List.ofFn} (\\mathrm{Fin.append}\\ a\ b) = \\operatorname{List.ofFn} a \\;\\;\\text{++}\\;\\; \\operatorname{List.ofFn} b $$$
Lean4
@[simp]
theorem ofFn_fin_append {m n} (a : Fin m → α) (b : Fin n → α) :
List.ofFn (Fin.append a b) = List.ofFn a ++ List.ofFn b :=
by
simp_rw [ofFn_add]
simp [Fin.append_left', Fin.append_right]