Theorems · Theorem · order theory
mem_lowerBounds_image2
∀ {α : Type u} {β : Type v} {γ : Type w} [inst : Preorder α] [inst_1 : Preorder β] [inst_2 : Preorder γ] {f : α → β → γ}
{s : Set α} {t : Set β} {a : α} {b : β},
(∀ (b : β), Monotone (Function.swap f b)) →
(∀ (a : α), Monotone (f a)) → a ∈ lowerBounds s → b ∈ lowerBounds t → f a b ∈ lowerBounds (Set.image2 f s t)- Defined in
- Mathlib.Order.Bounds.Image
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- Preorderstatement and proof · cited by 7,952
- Monotonestatement and proof · cited by 1,397
- Set.image2statement · cited by 311
- Function.swapstatement and proof · cited by 216
- lowerBoundsstatement and proof · cited by 212
- LE.le.trans'proof · cited by 140
- Set.forall_mem_image2proof · cited by 20
Cited by3
Results whose statement or proof uses this declaration.
- IsLeast.image2proof · cited by 0
- BddBelow.image2proof · cited by 0
- image2_lowerBounds_lowerBounds_subsetproof · cited by 0