Theorems · Theorem · combinatorics
Fin.append_right
∀ {m n : ℕ} {α : Sort u_1} (u : Fin m → α) (v : Fin n → α) (i : Fin n), Fin.append u v (Fin.natAdd m i) = v i- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fin.appendstatement · cited by 50
Cited by16
Results whose statement or proof uses this declaration.
- Fin.append_assocproof · cited by 3
- Fin.append_left_eq_consproof · cited by 3
- List.ofFn_fin_appendproof · cited by 2
- SubAddAction.ofFixingAddSubgroup.append_rightproof · cited by 1
- ExteriorAlgebra.ιMulti_family_mul_of_disjointproof · cited by 1
- ExteriorAlgebra.ιMulti_family_mul_of_not_disjointproof · cited by 1
- Fin.append_comp_sumElimproof · cited by 1
- Fin.append_left_nilproof · cited by 1
- Fin.append_revproof · cited by 1
- Fin.append_right_eq_snocproof · cited by 1
- RelSeries.append_apply_rightproof · cited by 1
- RelSeries.mem_snocproof · cited by 0