Theorems · Theorem · order theory
Order.IsNormal.map_isLUB
∀ {α : Type u_1} {β : Type u_2} {a : α} {f : α → β} [inst : LinearOrder α] [inst_1 : LinearOrder β],
Order.IsNormal f → ∀ {s : Set α}, IsLUB s a → s.Nonempty → IsLUB (f '' s) (f a)- Defined in
- Mathlib.Order.IsNormal
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderLinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Set.imagestatement and proof · cited by 5,609
- LE.le.transproof · cited by 3,151
- Set.Nonemptystatement and proof · cited by 2,627
- LT.lt.leproof · cited by 2,189
- IsLUBstatement and proof · cited by 280
- upperBoundsproof · cited by 263
- Order.IsSuccLimitproof · cited by 255
- Order.IsNormalstatement and proof · cited by 118
- StrictMono.le_iff_leproof · cited by 104
- Order.IsNormal.strictMonoproof · cited by 44
Cited by3
Results whose statement or proof uses this declaration.
- Order.IsNormal.map_sSupproof · cited by 5
- Order.IsNormal.dirSupClosed_rangeproof · cited by 2
- Order.IsNormal.isClub_fixedPointsproof · cited by 0