Theorems · Definition · order theory
GaloisInsertion.monotoneIntro
{α : Type u_2} →
{β : Type u_3} →
[inst : Preorder α] →
[inst_1 : Preorder β] →
{l : α → β} →
{u : β → α} →
Monotone u → Monotone l → (∀ (a : α), a ≤ u (l a)) → (∀ (b : β), l (u b) = b) → GaloisInsertion l uA constructor for a Galois insertion with the trivial choice function.
- Defined in
- Mathlib.Order.GaloisConnection.Defs
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Monotonestatement and proof · cited by 1,397
- GaloisInsertionstatement · cited by 35
Cited by5
Results whose statement or proof uses this declaration.
- Ideal.giMapComapproof · cited by 6
- Int.clogZPowGiproof · cited by 2
- NNRat.giproof · cited by 2
- Nat.giCountNthproof · cited by 1
- NNReal.giproof · cited by 1