Theorems · Theorem · order theory
StrictMono.comp
∀ {α : Type u} {β : Type v} {γ : Type w} [inst : Preorder α] [inst_1 : Preorder β] [inst_2 : Preorder γ] {g : β → γ}
{f : α → β}, StrictMono g → StrictMono f → StrictMono (g ∘ f)- Defined in
- Mathlib.Order.Monotone.Defs
- Cited by
- 36 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
- StrictMonostatement and proof · cited by 706
Cited by36
Results whose statement or proof uses this declaration.
- Ordinal.cof_map_of_isNormalproof · cited by 7
- Nat.nth_strictMonoproof · cited by 6
- EReal.coe_strictMonoproof · cited by 6
- Order.IsNormal.compproof · cited by 5
- IsSeqCompact.subseq_of_frequently_inproof · cited by 5
- WithTop.strictMono_iffproof · cited by 4
- Cardinal.IsInaccessible.preAleph_ordproof · cited by 3
- Cardinal.IsInaccessible.preBeth_ordproof · cited by 3
- Cardinal.beth_strictMonoproof · cited by 3
- StrictMono.iterateproof · cited by 3
- StrictMono.mul_constproof · cited by 2
- Cardinal.IsInaccessible.aleph_ordproof · cited by 2