Theorems · Theorem · order theory
StrictAnti.mem_upperBounds_image
∀ {α : Type u} {β : Type v} [inst : LinearOrder α] [inst_1 : Preorder β] {f : α → β} {a : α} {s : Set α},
StrictAnti f → (f a ∈ upperBounds (f '' s) ↔ a ∈ lowerBounds s)- Defined in
- Mathlib.Order.Bounds.Image
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrderPreorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- LinearOrderstatement and proof · cited by 8,572
- Preorderstatement and proof · cited by 7,952
- Set.ofPredproof · cited by 6,101
- Set.imagestatement · cited by 5,609
- upperBoundsstatement · cited by 263
- lowerBoundsstatement · cited by 212
- StrictAntistatement and proof · cited by 204
- StrictAnti.le_iff_geproof · cited by 16
Cited by1
Results whose statement or proof uses this declaration.
- StrictAnti.map_isGreatestproof · cited by 0