Theorems · Theorem · order theory
Finite.bddAbove_range
∀ {ι : Sort u_1} {α : Type u_2} [Finite ι] [Nonempty α] [inst : Preorder α] [IsDirectedOrder α] (f : ι → α),
BddAbove (Set.range f)- Defined in
- Mathlib.Data.Fintype.Order
- Cited by
- 11 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- Set.rangestatement and proof · cited by 4,705
- Finitestatement and proof · cited by 3,029
- BddAbovestatement · cited by 620
- IsDirectedOrderstatement and proof · cited by 316
- Finite.exists_leproof · cited by 4
Cited by11
Results whose statement or proof uses this declaration.
- Finite.le_ciSup_of_leproof · cited by 17
- Height.mulHeight_powproof · cited by 3
- Finite.ciSup_prodproof · cited by 2
- SSet.Subcomplex.Pairing.rank'_ltproof · cited by 1
- tendsto_iSup_of_tendsto_limsupproof · cited by 1
- FirstOrder.Language.DirectLimit.relMap_equiv_unifyproof · cited by 1
- FirstOrder.Language.DirectLimit.exists_quotient_mk'_sigma_mk'_eqproof · cited by 1
- FirstOrder.Language.DirectLimit.funMap_equiv_unifyproof · cited by 0
- Finite.ciSup_monoproof · cited by 0
- FirstOrder.Language.DirectLimit.exists_unify_eqproof · cited by 0
- FirstOrder.Language.DirectLimit.funMap_quotient_mk'_sigma_mk'proof · cited by 0