Theorems · Theorem · order theory
Finset.intervalGapsWithin_snd_of_lt
∀ {α : Type u_1} [inst : LinearOrder α] (F : Finset (α × α)) {k : ℕ} (h : F.card = k) (a b : α) (j : ℕ) (hj : j < k),
(F.intervalGapsWithin h a b ↑j).2 = ((F.orderEmbOfFin h) ⟨j, hj⟩).1- Defined in
- Mathlib.Order.Interval.Finset.Gaps
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 74 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.
Cites11
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 and proof · cited by 619
- DFunLikeproof · cited by 576
- Lexstatement and proof · cited by 370
- Fin.castPredproof · cited by 89
- Finset.orderEmbOfFinstatement and proof · cited by 47
- Finset.intervalGapsWithinstatement · cited by 20
- Finset.intervalGapsWithin.fstproof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- Finset.intervalGapsWithin_mapsToproof · cited by 6
- Finset.intervalGapsWithin_surjOnproof · cited by 2
- Finset.intervalGapsWithin_injOnproof · cited by 2
- Finset.intervalGapsWithin_pairwiseDisjoint_Iocproof · cited by 1
- Finset.intervalGapsWithin_fst_le_sndproof · cited by 1