Theorems · Theorem · order theory
inf_top_eq
∀ {α : Type u_1} [inst : SemilatticeInf α] [inst_1 : OrderTop α] (a : α), a ⊓ ⊤ = a- Defined in
- Mathlib.Order.BoundedOrder.Lattice
- Cited by
- 30 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext
- Assumes
- SemilatticeInfOrderTop
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.
- Top.topstatement · cited by 9,680
- SemilatticeInfstatement and proof · cited by 634
- OrderTopstatement and proof · cited by 493
- le_topproof · cited by 411
- inf_of_le_leftproof · cited by 186
Cited by30
Results whose statement or proof uses this declaration.
- Set.inter_univproof · cited by 198
- nhdsWithin_univproof · cited by 88
- Submodule.finrank_add_finrank_orthogonalproof · cited by 6
- uniformContinuousOn_univproof · cited by 4
- Disjoint.le_of_codisjointproof · cited by 3
- Filter.eventually_smallSets_forallproof · cited by 3
- Continuous.exists_forall_le'proof · cited by 3
- bihimp_topproof · cited by 3
- top_himpproof · cited by 2
- Coheyting.boundary_boundaryproof · cited by 2
- Finset.inf'_inductionproof · cited by 2
- Coheyting.hnot_hnot_sup_boundaryproof · cited by 2