Theorems · Theorem · order theory
Order.isNormal_iff
∀ {α : Type u_1} {β : Type u_2} [inst : LinearOrder α] [inst_1 : LinearOrder β] {f : α → β},
Order.IsNormal f ↔ StrictMono f ∧ ∀ (o : α), Order.IsSuccLimit o → ∀ (a : β), (∀ b < o, f b ≤ a) → f o ≤ a- Defined in
- Mathlib.Order.IsNormal
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Quot.sound
- Assumes
- LinearOrderLinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- Set.Iioproof · cited by 1,166
- StrictMonostatement and proof · cited by 706
- Order.IsSuccLimitstatement and proof · cited by 255
- Order.IsNormalstatement · cited by 118
Cited by8
Results whose statement or proof uses this declaration.
- Ordinal.isNormal_add_rightproof · cited by 13
- Ordinal.isNormal_preOmegaproof · cited by 3
- Cardinal.isNormal_preBethproof · cited by 2
- Ordinal.isNormal_veblenWith_zeroproof · cited by 1
- Order.IsNormal.to_Iioproof · cited by 0
- Ordinal.isNormal_enumOrdproof · cited by 0
- Order.isNormal_enum_iff_dirSupClosedproof · cited by 0
- Ordinal.enumOrd_isNormal_iff_isClosedproof · cited by 0