Mathlib Map

Theorems · Definition · order theory

BoundedOrder.lift

{α : Type u} →
  {β : Type v} →
    [inst : LE α] →
      [inst_1 : Top α] →
        [inst_2 : Bot α] →
          [inst_3 : LE β] →
            [inst_4 : BoundedOrder β] →
              (f : α → β) → (∀ (a b : α), f a ≤ f b → a ≤ b) → f ⊤ = ⊤ → f ⊥ = ⊥ → BoundedOrder α

Pullback a BoundedOrder.

Defined in
Mathlib.Order.BoundedOrder.Basic
Cited by
0 results in Mathlib
Foundations
Depth 8 from the axioms · uses no axioms
Assumes
LETopBotLEBoundedOrder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Function.Injective.completeLattice · cited by 0Injective.completeLatticeTop.top · cited by 9680Top.topBot.bot · cited by 4720Bot.botOrderBot · cited by 1055OrderBotOrderTop · cited by 493OrderTopBoundedOrder · cited by 270BoundedOrderBot · cited by 96BotTop · cited by 93TopOrderTop.lift · cited by 0OrderTop.liftOrderBot.lift · cited by 0OrderBot.liftBoundedOrder.liftCITED BYCITES

Cites9

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.