Mathlib Map

Theorems · Theorem · order theory

InitialSeg.map_bot

∀ {α : Type u_1} {β : Type u_2} [inst : PartialOrder β] [inst_1 : PartialOrder α] [inst_2 : OrderBot α]
  [inst_3 : OrderBot β] (f : α ≤i β), f ⊥ = ⊥
Defined in
Mathlib.Order.InitialSeg
Cited by
1 results in Mathlib
Foundations
Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
PartialOrderPartialOrderOrderBotOrderBot
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

PrincipalSeg.map_bot · cited by 0PrincipalSeg.map_botDFunLike.coe · cited by 62936DFunLike.coePartialOrder · cited by 6410PartialOrderBot.bot · cited by 4720Bot.botOrderBot · cited by 1055OrderBotInitialSeg · cited by 70InitialSegisMin_bot · cited by 15isMin_botIsMin.eq_bot · cited by 12IsMin.eq_botInitialSeg.map_isMin · cited by 1InitialSeg.map_isMinInitialSeg.map_botCITED BYCITES

Cites8

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.