Theorems · Theorem · combinatorics
Fin.comp_snoc
∀ {n : ℕ} {α : Sort u_2} {β : Sort u_3} (g : α → β) (q : Fin n → α) (y : α), g ∘ Fin.snoc q y = Fin.snoc (g ∘ q) (g y)- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fin.snocstatement and proof · cited by 113
- Fin.snoc_lastproof · cited by 37
Cited by4
Results whose statement or proof uses this declaration.
- FirstOrder.Language.StrongHomClass.realize_boundedFormulaproof · cited by 2
- FirstOrder.Language.Embedding.isElementary_of_existsproof · cited by 1
- FirstOrder.Language.BoundedFormula.IsUniversal.realize_embeddingproof · cited by 1
- FirstOrder.Language.BoundedFormula.IsExistential.realize_embeddingproof · cited by 0