Documentation Verification Report

Basic

πŸ“ Source: Mathlib/Order/Partition/Basic.lean

Statistics

MetricCount
Definitionscopy, instOrderTop, instPartialOrder, instSetLike, instUniqueBot, parts, partscopyEquiv, removeBot
8
Theoremsbot_lt_of_mem, bot_notMem, bot_notMem', coe_copy, coe_parts, coe_removeBot, disjoint, eq_of_not_disjoint, eq_or_disjoint, existsUnique_of_mem_le, exists_le_of_mem_le, ext, ext_iff, iSup_eq, le_def, le_of_mem, mem_copy_iff, mem_removeBot, mem_top_iff, ne_bot_of_mem, ne_bot_of_mem', notMem_of_bot, pairwiseDisjoint, parts_nonempty, parts_top, parts_top_subset, partscopyEquiv_apply_coe, partscopyEquiv_symm_apply_coe, sSupIndep, sSupIndep', sSup_eq, sSup_eq', top_def
33
Total41

Partition

Definitions

NameCategoryTheorems
copy πŸ“–CompOp
4 mathmath: coe_copy, partscopyEquiv_symm_apply_coe, mem_copy_iff, partscopyEquiv_apply_coe
instOrderTop πŸ“–CompOp
4 mathmath: parts_top, mem_top_iff, top_def, parts_top_subset
instPartialOrder πŸ“–CompOp
5 mathmath: parts_top, mem_top_iff, top_def, le_def, parts_top_subset
instSetLike πŸ“–CompOp
21 mathmath: existsUnique_of_mem_le, bot_notMem, parts_top, pairwiseDisjoint, exists_le_of_mem_le, coe_copy, mem_top_iff, partscopyEquiv_symm_apply_coe, le_def, iSup_eq, ext_iff, sSupIndep, mem_removeBot, mem_copy_iff, notMem_of_bot, sSup_eq, coe_removeBot, partscopyEquiv_apply_coe, parts_nonempty, coe_parts, parts_top_subset
instUniqueBot πŸ“–CompOpβ€”
parts πŸ“–CompOp
4 mathmath: sSupIndep', sSup_eq', bot_notMem', coe_parts
partscopyEquiv πŸ“–CompOp
2 mathmath: partscopyEquiv_symm_apply_coe, partscopyEquiv_apply_coe
removeBot πŸ“–CompOp
3 mathmath: top_def, mem_removeBot, coe_removeBot

Theorems

NameKindAssumesProvesValidatesDepends On
bot_lt_of_mem πŸ“–mathematicalPartition
SetLike.instMembership
instSetLike
Preorder.toLT
PartialOrder.toPreorder
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
Bot.bot
OrderBot.toBot
Preorder.toLE
SemilatticeSup.toPartialOrder
Lattice.toSemilatticeSup
CompleteLattice.toLattice
BoundedOrder.toOrderBot
CompleteLattice.toBoundedOrder
β€”bot_lt_iff_ne_bot
ne_bot_of_mem
bot_notMem πŸ“–mathematicalβ€”Partition
SetLike.instMembership
instSetLike
Bot.bot
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
SemilatticeSup.toPartialOrder
Lattice.toSemilatticeSup
CompleteLattice.toLattice
BoundedOrder.toOrderBot
CompleteLattice.toBoundedOrder
β€”bot_notMem'
bot_notMem' πŸ“–mathematicalβ€”Set
Set.instMembership
parts
Bot.bot
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
SemilatticeSup.toPartialOrder
Lattice.toSemilatticeSup
CompleteLattice.toLattice
BoundedOrder.toOrderBot
CompleteLattice.toBoundedOrder
β€”β€”
coe_copy πŸ“–mathematicalβ€”SetLike.coe
Partition
instSetLike
copy
β€”β€”
coe_parts πŸ“–mathematicalβ€”parts
SetLike.coe
Partition
instSetLike
β€”β€”
coe_removeBot πŸ“–mathematicalsSupIndep
SupSet.sSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
SetLike.coe
Partition
instSetLike
removeBot
Set
Set.instSDiff
Set.instSingletonSet
Bot.bot
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
SemilatticeSup.toPartialOrder
Lattice.toSemilatticeSup
CompleteLattice.toLattice
BoundedOrder.toOrderBot
CompleteLattice.toBoundedOrder
β€”β€”
disjoint πŸ“–mathematicalPartition
SetLike.instMembership
instSetLike
Disjoint
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
BoundedOrder.toOrderBot
Preorder.toLE
PartialOrder.toPreorder
CompleteLattice.toBoundedOrder
β€”sSupIndep.pairwiseDisjoint
sSupIndep
eq_of_not_disjoint πŸ“–β€”Partition
SetLike.instMembership
instSetLike
Disjoint
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
BoundedOrder.toOrderBot
Preorder.toLE
PartialOrder.toPreorder
CompleteLattice.toBoundedOrder
β€”β€”eq_or_disjoint
eq_or_disjoint πŸ“–mathematicalPartition
SetLike.instMembership
instSetLike
Disjoint
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
BoundedOrder.toOrderBot
Preorder.toLE
PartialOrder.toPreorder
CompleteLattice.toBoundedOrder
β€”disjoint
existsUnique_of_mem_le πŸ“–mathematicalPartition
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
SetLike.instMembership
instSetLike
ExistsUnique
Partition
SetLike.instMembership
instSetLike
Preorder.toLE
PartialOrder.toPreorder
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
β€”eq_of_not_disjoint
ne_bot_of_mem
Mathlib.Tactic.Contrapose.contraposeβ‚„
le_bot_iff
exists_le_of_mem_le πŸ“–mathematicalPartition
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
SetLike.instMembership
instSetLike
Partition
SetLike.instMembership
instSetLike
Preorder.toLE
PartialOrder.toPreorder
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
β€”β€”
ext πŸ“–β€”Partition
SetLike.instMembership
instSetLike
β€”β€”SetLike.ext
ext_iff πŸ“–mathematicalβ€”Partition
SetLike.instMembership
instSetLike
β€”ext
iSup_eq πŸ“–mathematicalβ€”iSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
Partition
SetLike.instMembership
instSetLike
β€”sSup_eq
sSup_eq_iSup
le_def πŸ“–mathematicalβ€”Partition
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
SetLike.instMembership
instSetLike
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
β€”β€”
le_of_mem πŸ“–mathematicalPartition
SetLike.instMembership
instSetLike
Preorder.toLE
PartialOrder.toPreorder
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
β€”LE.le.trans_eq
le_sSup
sSup_eq
mem_copy_iff πŸ“–mathematicalβ€”Partition
SetLike.instMembership
instSetLike
copy
β€”β€”
mem_removeBot πŸ“–mathematicalsSupIndep
SupSet.sSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
Partition
SetLike.instMembership
instSetLike
removeBot
Set
Set.instMembership
β€”β€”
mem_top_iff πŸ“–mathematicalβ€”Partition
SetLike.instMembership
instSetLike
Top.top
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
instOrderTop
β€”sSupIndep_singleton
sSup_singleton
top_def
mem_removeBot
Set.mem_singleton_iff
ne_bot_of_mem πŸ“–β€”Partition
SetLike.instMembership
instSetLike
β€”β€”bot_notMem
ne_bot_of_mem' πŸ“–β€”Partition
SetLike.instMembership
instSetLike
β€”β€”notMem_of_bot
notMem_of_bot πŸ“–mathematicalβ€”Partition
Bot.bot
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
SemilatticeSup.toPartialOrder
Lattice.toSemilatticeSup
CompleteLattice.toLattice
BoundedOrder.toOrderBot
CompleteLattice.toBoundedOrder
SetLike.instMembership
instSetLike
β€”bot_notMem
le_bot_iff
le_of_mem
pairwiseDisjoint πŸ“–mathematicalβ€”Set.PairwiseDisjoint
ConditionallyCompletePartialOrderSup.toPartialOrder
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
BoundedOrder.toOrderBot
Preorder.toLE
PartialOrder.toPreorder
CompleteLattice.toBoundedOrder
SetLike.coe
Partition
instSetLike
β€”sSupIndep.pairwiseDisjoint
sSupIndep'
parts_nonempty πŸ“–mathematicalβ€”Set.Nonempty
SetLike.coe
Partition
instSetLike
β€”Set.nonempty_iff_ne_empty
sSup_eq
sSup_empty
parts_top πŸ“–mathematicalβ€”SetLike.coe
Partition
instSetLike
Top.top
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
instOrderTop
Set
Set.instSingletonSet
β€”β€”
parts_top_subset πŸ“–mathematicalβ€”Set
Set.instHasSubset
SetLike.coe
Partition
instSetLike
Top.top
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
instOrderTop
Set.instSingletonSet
β€”β€”
partscopyEquiv_apply_coe πŸ“–mathematicalβ€”DFunLike.coe
Equiv
Partition
SetLike.instMembership
instSetLike
copy
EquivLike.toFunLike
Equiv.instEquivLike
partscopyEquiv
Set
Set.instMembership
SetLike.coe
β€”β€”
partscopyEquiv_symm_apply_coe πŸ“–mathematicalβ€”DFunLike.coe
Equiv
Partition
SetLike.instMembership
instSetLike
copy
EquivLike.toFunLike
Equiv.instEquivLike
Equiv.symm
partscopyEquiv
Set
Set.instMembership
SetLike.coe
β€”β€”
sSupIndep πŸ“–mathematicalβ€”sSupIndep
SetLike.coe
Partition
instSetLike
β€”sSupIndep'
sSupIndep' πŸ“–mathematicalβ€”sSupIndep
parts
β€”β€”
sSup_eq πŸ“–mathematicalβ€”SupSet.sSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
SetLike.coe
Partition
instSetLike
β€”sSup_eq'
sSup_eq' πŸ“–mathematicalβ€”SupSet.sSup
ConditionallyCompletePartialOrderSup.toSupSet
ConditionallyCompletePartialOrder.toConditionallyCompletePartialOrderSup
ConditionallyCompleteLattice.toConditionallyCompletePartialOrder
CompleteLattice.toConditionallyCompleteLattice
parts
β€”β€”
top_def πŸ“–mathematicalβ€”Top.top
Partition
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
instOrderTop
removeBot
Set
Set.instSingletonSet
sSupIndep_singleton
sSup_singleton
CompleteLattice.toCompleteSemilatticeSup
β€”β€”

---

← Back to Index