Theorems · Theorem · order theory
Order.IsNormal.preimage_Iic
∀ {α : Type u_1} {β : Type u_2} {f : α → β} [inst : ConditionallyCompleteLinearOrder α]
[inst_1 : ConditionallyCompleteLinearOrder β],
Order.IsNormal f →
∀ {x : β},
(f ⁻¹' Set.Iic x).Nonempty → BddAbove (f ⁻¹' Set.Iic x) → f ⁻¹' Set.Iic x = Set.Iic (sSup (f ⁻¹' Set.Iic x))- Defined in
- Mathlib.Order.IsNormal
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.preimagestatement and proof · cited by 4,946
- LE.le.transproof · cited by 3,151
- Set.Nonemptystatement and proof · cited by 2,627
- LT.lt.leproof · cited by 2,189
- le_antisymmproof · cited by 2,068
- le_reflproof · cited by 2,061
- Set.Iicstatement and proof · cited by 1,111
- SupSet.sSupstatement and proof · cited by 954
- BddAbovestatement and proof · cited by 620
- ConditionallyCompleteLinearOrderstatement and proof · cited by 542
- Set.mem_preimageproof · cited by 190
Cited by2
Results whose statement or proof uses this declaration.
- Order.IsNormal.le_iff_le_sSupproof · cited by 2
- Order.IsNormal.continuousproof · cited by 1