📁 Source: Mathlib/Topology/Order/SuccPred.lean
isOpen_iff
isOpen_singleton_iff
isOpen_singleton_of_not_isPredPrelimit
isPredLimit_of_mem_frontier
nhds_eq_pure
isOpen_singleton_of_not_isSuccPrelimit
isSuccLimit_of_mem_frontier
IsOpen
Preorder.toLT
PartialOrder.toPreorder
SemilatticeInf.toPartialOrder
Lattice.toSemilatticeInf
DistribLattice.toLattice
instDistribLatticeOfLinearOrder
Set
Set.instHasSubset
Set.Ioo
isOpen_iff_mem_nhds
Filter.HasBasis.mem_iff
hasBasis_nhds_Ioc_of_exists_gt
not_isMax_iff
Order.IsPredLimit.not_isMax
instIsEmptyFalse
Set.instSingletonSet
Order.IsPredLimit
SuccOrder.isOpen_singleton_iff
instOrderTopologyOrderDual
OrderDual.noMaxOrder
Iff.not
Order.isSuccLimit_toDual_iff
Order.IsPredPrelimit
SuccOrder.isOpen_singleton_of_not_isSuccPrelimit
Order.isSuccPrelimit_toDual_iff
Set.instMembership
frontier
SuccOrder.isSuccLimit_of_mem_frontier
nhds
Filter
Filter.instPure
isOpen_singleton_iff_nhds_eq_pure
hasBasis_nhds_Ioc_of_exists_lt
not_isMin_iff
Order.IsSuccLimit.not_isMin
Order.IsSuccLimit
Mathlib.Tactic.Nontriviality.subsingleton_or_nontrivial_elim
Finite.instDiscreteTopology
T2Space.t1Space
OrderClosedTopology.to_t2Space
OrderTopology.to_orderClosedTopology
Finite.of_subsingleton
WellFoundedGT.toIsSuccArchimedean
IsWellOrder.toIsWellFounded
isWellOrder_gt
Finite.to_wellFoundedGT
mem_nhds_iff_exists_Ioo_subset'
not_isMax
IsOpen.mem_nhds
Set.mem_singleton
Order.IsSuccLimit.isSuccPrelimit
Order.succ_eq_iff_covBy
Order.lt_succ
LE.le.trans_lt
LT.lt.succ_le
Order.not_isSuccLimit_iff
Order.Iio_succ
IsMin.Iic_eq
isOpen_Iio
instClosedIciTopology
Order.IsSuccPrelimit
Order.not_isSuccPrelimit_iff_exists_covBy
CovBy.Ioi_eq
isOpen_Ioi
instClosedIicTopology
CovBy.Ioo_eq_Ioc
Order.covBy_succ_of_not_isMax
CovBy.Ioc_eq
isOpen_Ioo
Iff.not_left
frontier_eq_closure_inter_closure
---
← Back to Index