Theorems · Theorem · order theory
Finset.orderEmbOfFin_mem
∀ {α : Type u_1} [inst : LinearOrder α] (s : Finset α) {k : ℕ} (h : s.card = k) (i : Fin k), (s.orderEmbOfFin h) i ∈ s- Defined in
- Mathlib.Data.Finset.Sort
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- LinearOrderstatement and proof · cited by 8,572
- Finset.cardstatement and proof · cited by 2,327
- OrderEmbeddingstatement · cited by 619
- Finset.orderEmbOfFinstatement · cited by 47
- Finset.orderIsoOfFinproof · cited by 7
Cited by4
Results whose statement or proof uses this declaration.
- Finset.intervalGapsWithin_mapsToproof · cited by 6
- exteriorPower.ιMultiDual_apply_nondiagproof · cited by 3
- MultilinearMap.curryFinFinset_symm_apply_piecewise_constproof · cited by 2
- Finset.intervalGapsWithin_fst_le_sndproof · cited by 1