📁 Source: Mathlib/SetTheory/Ordinal/Enum.lean
enumOrd
enumOrdOrderIso
enumOrd_inj
enumOrd_injective
enumOrd_le_enumOrd
enumOrd_le_of_forall_lt
enumOrd_le_of_subset
enumOrd_lt_enumOrd
enumOrd_mem
enumOrd_range
enumOrd_strictMono
enumOrd_succ_le
enumOrd_surjective
enumOrd_univ
enumOrd_zero
eq_enumOrd
id_le_enumOrd
isNormal_enumOrd
le_enumOrd_self
range_enumOrd
coe_preOmega
deriv_eq_enumOrd
enumOrd_isNormal_iff_isClosed
derivFamily_eq_enumOrd
BddAbove
Ordinal
Preorder.toLE
PartialOrder.toPreorder
partialOrder
StrictMono.injective
StrictMono.le_iff_le
Set
Set.instMembership
Preorder.toLT
csInf_le'
Set.instHasSubset
Pi.hasLe
csInf_le_csInf'
Set.inter_subset_inter
Set.setOf_subset_setOf_of_imp
Mathlib.Tactic.GCongr.imp_right_mono
lt_imp_lt_of_le_of_le
le_refl
StrictMono.lt_iff_lt
StrictMono
Set.range
StrictMono.not_bddAbove_range_of_wellFoundedLT
wellFoundedLT
instNoMaxOrder
Order.succ
instSuccOrder
LE.le.trans_lt
StrictMono.monotone
Order.lt_succ_iff
Set.univ
Set.range_id
strictMono_id
zero
InfSet.sInf
ConditionallyCompletePartialOrderInf.toInfSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderInf
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
ConditionallyCompleteLinearOrder.toConditionallyCompleteLattice
ConditionallyCompleteLinearOrderBot.toConditionallyCompleteLinearOrder
instConditionallyCompleteLinearOrderBot
canonicallyOrderedAdd
instIsEmptyFalse
Set.inter_univ
StrictMono.id_le
SupSet.sSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
Order.IsNormal
instLinearOrder
Order.isNormal_iff
Order.IsSuccLimit.bot_lt
Set.range_nonempty
bddAbove_of_small
small_range
small_Iio
LT.lt.trans_le
Order.lt_succ
le_iSup
Order.IsSuccLimit.succ_lt
iSup_le
StrictMono.le_apply
Set.ext
LE.le.antisymm
LT.lt.not_ge
csInf_mem
---
← Back to Index