Documentation Verification Report

Concept

πŸ“ Source: Mathlib/Order/Concept.lean

Statistics

MetricCount
DefinitionsConcept, copy, extent, instBoundedOrderConcept, instCompleteLattice, instInfSet, instInhabited, instLattice, instMax, instMin, instPartialOrder, instSemilatticeInf, instSemilatticeSup, instSupSet, intent, ofAttribute, ofAttributes, ofIsExtent, ofIsIntent, ofObject, ofObjects, swap, swapEquiv, IsExtent, IsIntent, extentClosure, intentClosure, lowerPolar, upperPolar
29
Theoremscodisjoint_extent_intent, compl_extent, compl_intent, copy_eq, disjoint_extent_intent, ext, ext', ext_iff, extent_bot, extent_copy, extent_iInf, extent_iSup, extent_inf, extent_injective, extent_max, extent_min, extent_ofAttributes, extent_ofIsExtent, extent_ofIsIntent, extent_ofObjects, extent_ofObjects_of_isExtent, extent_sInf, extent_sSup, extent_ssubset_extent_iff, extent_subset_extent_iff, extent_sup, extent_swap, extent_top, intent_bot, intent_copy, intent_iInf, intent_iSup, intent_inf, intent_injective, intent_max, intent_min, intent_ofAttributes, intent_ofAttributes_of_isIntent, intent_ofIsExtent, intent_ofIsIntent, intent_ofObjects, intent_sInf, intent_sSup, intent_ssubset_intent_iff, intent_subset_intent_iff, intent_sup, intent_swap, intent_top, isCompl_extent_intent, isExtent_extent, isExtent_iff_exists_concept, isIntent_iff_exists_concept, isIntent_intent, isLowerSet_extent_le, isLowerSet_extent_lt, isUpperSet_intent_le, isUpperSet_intent_lt, le_ofAttributes_iff, le_ofObjects_of_extent_subset, leftInvOn_extent_ofObjects, leftInvOn_ofObjects_intent, leftInverse_ofAttributes_extent, leftInverse_ofObjects_extent, lowerPolar_intent, mem_extent_of_rel_extent, mem_intent_of_intent_rel, ofAttributes_intent, ofAttributes_le_of_intent_subset, ofObject_le_ofAttribute_iff, ofObjects_extent, ofObjects_le_iff, rel_extent_intent, strictAnti_intent, strictMono_extent, surjective_ofAttributes, surjective_ofObjects, swapEquiv_apply, swapEquiv_symm_apply, swap_le_swap_iff, swap_lt_swap_iff, swap_swap, upperPolar_extent, eq, iInter, iInterβ‚‚, inter, lowerPolar_upperPolar_subset, univ, eq, iInter, iInterβ‚‚, inter, univ, upperPolar_lowerPolar_subset, isExtent_iff, isExtent_lowerPolar, isIntent_iff, isIntent_upperPolar, extentClosure_apply, extentClosure_isClosed, gc_lowerPolar_upperPolar, gc_upperPolar_lowerPolar, intentClosure_apply, intentClosure_isClosed, lowerPolar_anti, lowerPolar_empty, lowerPolar_iUnion, lowerPolar_iUnionβ‚‚, lowerPolar_le, lowerPolar_swap, lowerPolar_union, lowerPolar_upperPolar_lowerPolar, lowerPolar_upperPolar_monotone, mem_lowerPolar_iff, mem_lowerPolar_singleton, mem_upperPolar_iff, mem_upperPolar_singleton, subset_lowerPolar_upperPolar, subset_upperPolar_iff_subset_lowerPolar, subset_upperPolar_lowerPolar, upperPolar_anti, upperPolar_empty, upperPolar_iUnion, upperPolar_iUnionβ‚‚, upperPolar_le, upperPolar_lowerPolar_monotone, upperPolar_lowerPolar_upperPolar, upperPolar_swap, upperPolar_union
129
Total158

Concept

Definitions

NameCategoryTheorems
copy πŸ“–CompOp
3 mathmath: intent_copy, copy_eq, extent_copy
extent πŸ“–CompOp
43 mathmath: ofObjects_extent, lowerPolar_intent, extent_sSup, isLowerSet_extent_lt, extent_iInf, intent_iInf, intent_inf, mem_extent_of_rel_extent, isCompl_extent_intent, extent_ofIsExtent, extent_injective, extent_swap, compl_intent, ext_iff, extent_iSup, extent_ofObjects, extent_ofAttributes, extent_min, codisjoint_extent_intent, intent_swap, extent_subset_extent_iff, intent_min, isLowerSet_extent_le, intent_sInf, extent_sup, ofObjects_le_iff, isExtent_iff_exists_concept, extent_max, extent_top, extent_inf, extent_ofIsIntent, leftInvOn_extent_ofObjects, strictMono_extent, leftInverse_ofObjects_extent, extent_ofObjects_of_isExtent, extent_ssubset_extent_iff, compl_extent, upperPolar_extent, extent_bot, extent_sInf, isExtent_extent, disjoint_extent_intent, extent_copy
instBoundedOrderConcept πŸ“–CompOp
4 mathmath: intent_bot, intent_top, extent_top, extent_bot
instCompleteLattice πŸ“–CompOpβ€”
instInfSet πŸ“–CompOp
4 mathmath: extent_iInf, intent_iInf, intent_sInf, extent_sInf
instInhabited πŸ“–CompOpβ€”
instLattice πŸ“–CompOpβ€”
instMax πŸ“–CompOp
4 mathmath: intent_max, intent_sup, extent_sup, extent_max
instMin πŸ“–CompOp
4 mathmath: intent_inf, extent_min, intent_min, extent_inf
instPartialOrder πŸ“–CompOp
29 mathmath: ofAttributes_le_of_intent_subset, intent_bot, DedekindCut.principalEmbedding_apply, DedekindCut.principalEmbedding_trans_factorEmbedding, intent_subset_intent_iff, DedekindCut.coe_principalEmbedding, DedekindCut.factorEmbedding_apply, swap_le_swap_iff, DedekindCut.principal_lt_principal, swapEquiv_apply, DedekindCut.principal_le_principal, intent_ssubset_intent_iff, extent_subset_extent_iff, DedekindCut.factorEmbedding_principal, ofObjects_le_iff, strictAnti_intent, le_ofAttributes_iff, swap_lt_swap_iff, DedekindCut.principalIso_apply, intent_top, DedekindCut.instTotalLe, ofObject_le_ofAttribute_iff, extent_top, strictMono_extent, le_ofObjects_of_extent_subset, swapEquiv_symm_apply, extent_ssubset_extent_iff, extent_bot, DedekindCut.principalIso_symm_apply
instSemilatticeInf πŸ“–CompOpβ€”
instSemilatticeSup πŸ“–CompOpβ€”
instSupSet πŸ“–CompOp
4 mathmath: extent_sSup, intent_sSup, intent_iSup, extent_iSup
intent πŸ“–CompOp
42 mathmath: intent_bot, intent_max, lowerPolar_intent, intent_ofIsExtent, extent_sSup, ofAttributes_intent, intent_sSup, intent_iInf, intent_inf, isCompl_extent_intent, intent_subset_intent_iff, isIntent_intent, intent_iSup, leftInvOn_ofObjects_intent, intent_ofObjects, extent_swap, compl_intent, extent_iSup, intent_copy, intent_ofAttributes_of_isIntent, codisjoint_extent_intent, intent_ofAttributes, intent_swap, intent_sup, intent_ssubset_intent_iff, isIntent_iff_exists_concept, intent_min, leftInverse_ofAttributes_extent, isUpperSet_intent_lt, isUpperSet_intent_le, intent_sInf, extent_sup, strictAnti_intent, extent_max, le_ofAttributes_iff, intent_top, mem_intent_of_intent_rel, intent_ofIsIntent, compl_extent, upperPolar_extent, intent_injective, disjoint_extent_intent
ofAttribute πŸ“–CompOp
2 mathmath: DedekindCut.ofAttribute_eq_principal, ofObject_le_ofAttribute_iff
ofAttributes πŸ“–CompOp
9 mathmath: ofAttributes_le_of_intent_subset, ofAttributes_intent, leftInvOn_ofObjects_intent, surjective_ofAttributes, extent_ofAttributes, intent_ofAttributes_of_isIntent, intent_ofAttributes, leftInverse_ofAttributes_extent, le_ofAttributes_iff
ofIsExtent πŸ“–CompOp
2 mathmath: intent_ofIsExtent, extent_ofIsExtent
ofIsIntent πŸ“–CompOp
2 mathmath: extent_ofIsIntent, intent_ofIsIntent
ofObject πŸ“–CompOp
2 mathmath: ofObject_le_ofAttribute_iff, DedekindCut.ofObject_eq_principal
ofObjects πŸ“–CompOp
9 mathmath: ofObjects_extent, intent_ofObjects, extent_ofObjects, surjective_ofObjects, ofObjects_le_iff, leftInvOn_extent_ofObjects, leftInverse_ofObjects_extent, le_ofObjects_of_extent_subset, extent_ofObjects_of_isExtent
swap πŸ“–CompOp
7 mathmath: swap_le_swap_iff, extent_swap, swap_swap, swapEquiv_apply, intent_swap, swap_lt_swap_iff, swapEquiv_symm_apply
swapEquiv πŸ“–CompOp
2 mathmath: swapEquiv_apply, swapEquiv_symm_apply

Theorems

NameKindAssumesProvesValidatesDepends On
codisjoint_extent_intent πŸ“–mathematicalβ€”Codisjoint
Set
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
Set.instOrderTop
extent
intent
β€”codisjoint_iff_le_sup
upperPolar_extent
Not.imp_symm
mem_extent_of_rel_extent
compl_extent πŸ“–mathematicalβ€”Compl.compl
Set
Set.instCompl
extent
intent
β€”IsCompl.compl_eq
isCompl_extent_intent
compl_intent πŸ“–mathematicalβ€”Compl.compl
Set
Set.instCompl
intent
extent
β€”IsCompl.compl_eq
IsCompl.symm
isCompl_extent_intent
copy_eq πŸ“–mathematicalextent
intent
copyβ€”ext
Set.ext
copy.congr_simp
disjoint_extent_intent πŸ“–mathematicalβ€”Disjoint
Set
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
HeytingAlgebra.toOrderBot
Order.Frame.toHeytingAlgebra
CompleteDistribLattice.toFrame
CompleteBooleanAlgebra.toCompleteDistribLattice
extent
intent
β€”Set.disjoint_iff_forall_ne
irrefl
rel_extent_intent
ext πŸ“–β€”extentβ€”β€”β€”
ext' πŸ“–β€”intentβ€”β€”β€”
ext_iff πŸ“–mathematicalβ€”extentβ€”ext
extent_bot πŸ“–mathematicalβ€”extent
Bot.bot
Concept
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
BoundedOrder.toOrderBot
instBoundedOrderConcept
lowerPolar
Set.univ
β€”β€”
extent_copy πŸ“–mathematicalextent
intent
extent
copy
β€”β€”
extent_iInf πŸ“–mathematicalβ€”extent
iInf
Concept
instInfSet
Set.iInter
β€”iInf_range
extent_iSup πŸ“–mathematicalβ€”extent
iSup
Concept
instSupSet
lowerPolar
Set.iInter
intent
β€”iInf_range
extent_inf πŸ“–mathematicalβ€”extent
Concept
instMin
Set
Set.instInter
β€”extent_min
extent_injective πŸ“–mathematicalβ€”Concept
Set
extent
β€”ext
extent_max πŸ“–mathematicalβ€”extent
Concept
instMax
lowerPolar
Set
Set.instInter
intent
β€”β€”
extent_min πŸ“–mathematicalβ€”extent
Concept
instMin
Set
Set.instInter
β€”β€”
extent_ofAttributes πŸ“–mathematicalβ€”extent
ofAttributes
lowerPolar
β€”β€”
extent_ofIsExtent πŸ“–mathematicalOrder.IsExtentextent
ofIsExtent
β€”β€”
extent_ofIsIntent πŸ“–mathematicalOrder.IsIntentextent
ofIsIntent
lowerPolar
β€”β€”
extent_ofObjects πŸ“–mathematicalβ€”extent
ofObjects
lowerPolar
upperPolar
β€”β€”
extent_ofObjects_of_isExtent πŸ“–mathematicalOrder.IsExtentextent
ofObjects
β€”Order.IsExtent.eq
extent_sInf πŸ“–mathematicalβ€”extent
InfSet.sInf
Concept
instInfSet
Set.iInter
Set
Set.instMembership
β€”β€”
extent_sSup πŸ“–mathematicalβ€”extent
SupSet.sSup
Concept
instSupSet
lowerPolar
Set.iInter
Set
Set.instMembership
intent
β€”β€”
extent_ssubset_extent_iff πŸ“–mathematicalβ€”Set
Set.instHasSSubset
extent
Concept
Preorder.toLT
PartialOrder.toPreorder
instPartialOrder
β€”β€”
extent_subset_extent_iff πŸ“–mathematicalβ€”Set
Set.instHasSubset
extent
Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
β€”β€”
extent_sup πŸ“–mathematicalβ€”extent
Concept
instMax
lowerPolar
Set
Set.instInter
intent
β€”extent_max
extent_swap πŸ“–mathematicalβ€”extent
Function.swap
swap
intent
β€”β€”
extent_top πŸ“–mathematicalβ€”extent
Top.top
Concept
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
BoundedOrder.toOrderTop
instBoundedOrderConcept
Set.univ
β€”β€”
intent_bot πŸ“–mathematicalβ€”intent
Bot.bot
Concept
OrderBot.toBot
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
BoundedOrder.toOrderBot
instBoundedOrderConcept
Set.univ
β€”β€”
intent_copy πŸ“–mathematicalextent
intent
intent
copy
β€”β€”
intent_iInf πŸ“–mathematicalβ€”intent
iInf
Concept
instInfSet
upperPolar
Set.iInter
extent
β€”iInf_range
intent_iSup πŸ“–mathematicalβ€”intent
iSup
Concept
instSupSet
Set.iInter
β€”iInf_range
intent_inf πŸ“–mathematicalβ€”intent
Concept
instMin
upperPolar
Set
Set.instInter
extent
β€”intent_min
intent_injective πŸ“–mathematicalβ€”Concept
Set
intent
β€”ext'
intent_max πŸ“–mathematicalβ€”intent
Concept
instMax
Set
Set.instInter
β€”β€”
intent_min πŸ“–mathematicalβ€”intent
Concept
instMin
upperPolar
Set
Set.instInter
extent
β€”β€”
intent_ofAttributes πŸ“–mathematicalβ€”intent
ofAttributes
upperPolar
lowerPolar
β€”β€”
intent_ofAttributes_of_isIntent πŸ“–mathematicalOrder.IsIntentintent
ofAttributes
β€”Order.IsIntent.eq
intent_ofIsExtent πŸ“–mathematicalOrder.IsExtentintent
ofIsExtent
upperPolar
β€”β€”
intent_ofIsIntent πŸ“–mathematicalOrder.IsIntentintent
ofIsIntent
β€”β€”
intent_ofObjects πŸ“–mathematicalβ€”intent
ofObjects
upperPolar
β€”β€”
intent_sInf πŸ“–mathematicalβ€”intent
InfSet.sInf
Concept
instInfSet
upperPolar
Set.iInter
Set
Set.instMembership
extent
β€”β€”
intent_sSup πŸ“–mathematicalβ€”intent
SupSet.sSup
Concept
instSupSet
Set.iInter
Set
Set.instMembership
β€”β€”
intent_ssubset_intent_iff πŸ“–mathematicalβ€”Set
Set.instHasSSubset
intent
Concept
Preorder.toLT
PartialOrder.toPreorder
instPartialOrder
β€”ssubset_iff_subset_not_subset
Set.instIsNonstrictStrictOrderSubsetSSubset
lt_iff_le_not_ge
intent_subset_intent_iff
intent_subset_intent_iff πŸ“–mathematicalβ€”Set
Set.instHasSubset
intent
Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
β€”extent_subset_extent_iff
lowerPolar_intent
lowerPolar_anti
upperPolar_extent
upperPolar_anti
intent_sup πŸ“–mathematicalβ€”intent
Concept
instMax
Set
Set.instInter
β€”intent_max
intent_swap πŸ“–mathematicalβ€”intent
Function.swap
swap
extent
β€”β€”
intent_top πŸ“–mathematicalβ€”intent
Top.top
Concept
OrderTop.toTop
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
BoundedOrder.toOrderTop
instBoundedOrderConcept
upperPolar
Set.univ
β€”β€”
isCompl_extent_intent πŸ“–mathematicalβ€”IsCompl
Set
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
Set.instBoundedOrder
extent
intent
β€”disjoint_extent_intent
IsStrictOrder.toIrrefl
IsStrictTotalOrder.toIsStrictOrder
codisjoint_extent_intent
IsStrictTotalOrder.toTrichotomous
IsStrictOrder.toIsTrans
isExtent_extent πŸ“–mathematicalβ€”Order.IsExtent
extent
β€”Order.isExtent_lowerPolar
lowerPolar_intent
isExtent_iff_exists_concept πŸ“–mathematicalβ€”Order.IsExtent
Concept
extent
β€”isExtent_extent
isIntent_iff_exists_concept πŸ“–mathematicalβ€”Order.IsIntent
Concept
intent
β€”isIntent_intent
isIntent_intent πŸ“–mathematicalβ€”Order.IsIntent
intent
β€”Order.isIntent_upperPolar
upperPolar_extent
isLowerSet_extent_le πŸ“–mathematicalβ€”IsLowerSet
Preorder.toLE
extent
β€”mem_extent_of_rel_extent
instIsTransLe
isLowerSet_extent_lt πŸ“–mathematicalβ€”IsLowerSet
Preorder.toLE
PartialOrder.toPreorder
extent
Preorder.toLT
β€”LE.le.eq_or_lt
mem_extent_of_rel_extent
instIsTransLt
isUpperSet_intent_le πŸ“–mathematicalβ€”IsUpperSet
Preorder.toLE
intent
β€”mem_intent_of_intent_rel
instIsTransLe
isUpperSet_intent_lt πŸ“–mathematicalβ€”IsUpperSet
Preorder.toLE
PartialOrder.toPreorder
intent
Preorder.toLT
β€”LE.le.eq_or_lt
mem_intent_of_intent_rel
instIsTransLt
le_ofAttributes_iff πŸ“–mathematicalβ€”Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
ofAttributes
Set
Set.instHasSubset
intent
β€”intent_subset_intent_iff
HasSubset.Subset.trans
Set.instIsTransSubset
subset_upperPolar_lowerPolar
Order.IsIntent.upperPolar_lowerPolar_subset
isIntent_intent
le_ofObjects_of_extent_subset πŸ“–mathematicalSet
Set.instHasSubset
extent
Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
ofObjects
β€”upperPolar_extent
lowerPolar_intent
Antitone.comp
lowerPolar_anti
upperPolar_anti
leftInvOn_extent_ofObjects πŸ“–mathematicalβ€”Set.LeftInvOn
Set
Concept
extent
ofObjects
setOf
Order.IsExtent
β€”Order.IsExtent.eq
leftInvOn_ofObjects_intent πŸ“–mathematicalβ€”Set.LeftInvOn
Set
Concept
intent
ofAttributes
setOf
Order.IsIntent
β€”Order.IsIntent.eq
leftInverse_ofAttributes_extent πŸ“–mathematicalβ€”Concept
Set
ofAttributes
intent
β€”extent_injective
lowerPolar_intent
leftInverse_ofObjects_extent πŸ“–mathematicalβ€”Concept
Set
ofObjects
extent
β€”ofObjects_extent
lowerPolar_intent πŸ“–mathematicalβ€”lowerPolar
intent
extent
β€”β€”
mem_extent_of_rel_extent πŸ“–mathematicalSet
Set.instMembership
extent
Set
Set.instMembership
extent
β€”lowerPolar_intent
trans
rel_extent_intent
mem_intent_of_intent_rel πŸ“–mathematicalSet
Set.instMembership
intent
Set
Set.instMembership
intent
β€”upperPolar_extent
trans
rel_extent_intent
ofAttributes_intent πŸ“–mathematicalβ€”ofAttributes
intent
β€”extent_injective
lowerPolar_intent
ofAttributes_le_of_intent_subset πŸ“–mathematicalSet
Set.instHasSubset
intent
Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
ofAttributes
β€”intent_subset_intent_iff
lowerPolar_intent
upperPolar_extent
Antitone.comp
upperPolar_anti
lowerPolar_anti
ofObject_le_ofAttribute_iff πŸ“–mathematicalβ€”Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
ofObject
ofAttribute
β€”β€”
ofObjects_extent πŸ“–mathematicalβ€”ofObjects
extent
β€”intent_injective
upperPolar_extent
ofObjects_le_iff πŸ“–mathematicalβ€”Concept
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
ofObjects
Set
Set.instHasSubset
extent
β€”extent_subset_extent_iff
HasSubset.Subset.trans
Set.instIsTransSubset
subset_lowerPolar_upperPolar
Order.IsExtent.lowerPolar_upperPolar_subset
isExtent_extent
rel_extent_intent πŸ“–β€”Set
Set.instMembership
extent
intent
β€”β€”upperPolar_extent
strictAnti_intent πŸ“–mathematicalβ€”StrictAnti
Concept
Set
PartialOrder.toPreorder
instPartialOrder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
intent
β€”intent_ssubset_intent_iff
strictMono_extent πŸ“–mathematicalβ€”StrictMono
Concept
Set
PartialOrder.toPreorder
instPartialOrder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
extent
β€”extent_ssubset_extent_iff
surjective_ofAttributes πŸ“–mathematicalβ€”Set
Concept
ofAttributes
β€”Function.LeftInverse.surjective
leftInverse_ofAttributes_extent
surjective_ofObjects πŸ“–mathematicalβ€”Set
Concept
ofObjects
β€”Function.LeftInverse.surjective
leftInverse_ofObjects_extent
swapEquiv_apply πŸ“–mathematicalβ€”DFunLike.coe
RelIso
OrderDual
Concept
Function.swap
OrderDual.instLE
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
RelIso.instFunLike
swapEquiv
swap
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
OrderDual.ofDual
β€”β€”
swapEquiv_symm_apply πŸ“–mathematicalβ€”DFunLike.coe
RelIso
Concept
Function.swap
OrderDual
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
OrderDual.instLE
RelIso.instFunLike
RelIso.symm
swapEquiv
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
OrderDual.toDual
swap
β€”β€”
swap_le_swap_iff πŸ“–mathematicalβ€”Concept
Function.swap
Preorder.toLE
PartialOrder.toPreorder
instPartialOrder
swap
β€”intent_subset_intent_iff
swap_lt_swap_iff πŸ“–mathematicalβ€”Concept
Function.swap
Preorder.toLT
PartialOrder.toPreorder
instPartialOrder
swap
β€”intent_ssubset_intent_iff
swap_swap πŸ“–mathematicalβ€”swap
Function.swap
β€”ext
upperPolar_extent πŸ“–mathematicalβ€”upperPolar
extent
intent
β€”β€”

Order

Definitions

NameCategoryTheorems
IsExtent πŸ“–MathDef
9 mathmath: isExtent_iff, IsExtent.iInterβ‚‚, Concept.isExtent_iff_exists_concept, IsExtent.iInter, Concept.leftInvOn_extent_ofObjects, IsExtent.univ, isExtent_lowerPolar, Concept.isExtent_extent, IsExtent.inter
IsIntent πŸ“–MathDef
9 mathmath: IsIntent.iInter, IsIntent.inter, Concept.isIntent_intent, Concept.leftInvOn_ofObjects_intent, IsIntent.iInterβ‚‚, Concept.isIntent_iff_exists_concept, isIntent_iff, IsIntent.univ, isIntent_upperPolar

Theorems

NameKindAssumesProvesValidatesDepends On
isExtent_iff πŸ“–mathematicalβ€”IsExtent
lowerPolar
upperPolar
β€”lowerPolar_upperPolar_lowerPolar
isExtent_lowerPolar πŸ“–mathematicalβ€”IsExtent
lowerPolar
β€”β€”
isIntent_iff πŸ“–mathematicalβ€”IsIntent
upperPolar
lowerPolar
β€”isExtent_iff
isIntent_upperPolar πŸ“–mathematicalβ€”IsIntent
upperPolar
β€”β€”

Order.IsExtent

Theorems

NameKindAssumesProvesValidatesDepends On
eq πŸ“–mathematicalOrder.IsExtentlowerPolar
upperPolar
β€”Order.isExtent_iff
iInter πŸ“–mathematicalOrder.IsExtentOrder.IsExtent
Set.iInter
β€”lowerPolar_iUnion
Set.iInter_congr
eq
iInterβ‚‚ πŸ“–mathematicalOrder.IsExtentOrder.IsExtent
Set.iInter
β€”lowerPolar_iUnionβ‚‚
Set.iInterβ‚‚_congr
eq
inter πŸ“–mathematicalOrder.IsExtentOrder.IsExtent
Set
Set.instInter
β€”lowerPolar_union
lowerPolar_upperPolar_subset πŸ“–mathematicalOrder.IsExtent
Set
Set.instHasSubset
Set
Set.instHasSubset
lowerPolar
upperPolar
β€”eq
lowerPolar_upperPolar_monotone
univ πŸ“–mathematicalβ€”Order.IsExtent
Set.univ
β€”Order.isExtent_iff
GaloisConnection.u_l_top
gc_upperPolar_lowerPolar

Order.IsIntent

Theorems

NameKindAssumesProvesValidatesDepends On
eq πŸ“–mathematicalOrder.IsIntentupperPolar
lowerPolar
β€”Order.isIntent_iff
iInter πŸ“–mathematicalOrder.IsIntentOrder.IsIntent
Set.iInter
β€”Order.IsExtent.iInter
iInterβ‚‚ πŸ“–mathematicalOrder.IsIntentOrder.IsIntent
Set.iInter
β€”Order.IsExtent.iInterβ‚‚
inter πŸ“–mathematicalOrder.IsIntentOrder.IsIntent
Set
Set.instInter
β€”Order.IsExtent.inter
univ πŸ“–mathematicalβ€”Order.IsIntent
Set.univ
β€”Order.IsExtent.univ
upperPolar_lowerPolar_subset πŸ“–mathematicalOrder.IsIntent
Set
Set.instHasSubset
Set
Set.instHasSubset
upperPolar
lowerPolar
β€”eq
upperPolar_lowerPolar_monotone

(root)

Definitions

NameCategoryTheorems
Concept πŸ“–CompData
45 mathmath: Concept.ofAttributes_le_of_intent_subset, Concept.intent_bot, Concept.intent_max, Concept.extent_sSup, Concept.extent_iInf, Concept.intent_sSup, Concept.intent_iInf, Concept.intent_inf, Concept.intent_subset_intent_iff, Concept.intent_iSup, Concept.leftInvOn_ofObjects_intent, Concept.swap_le_swap_iff, Concept.extent_injective, Concept.extent_iSup, Concept.swapEquiv_apply, Concept.surjective_ofAttributes, Concept.extent_min, Concept.intent_sup, Concept.intent_ssubset_intent_iff, Concept.extent_subset_extent_iff, Concept.isIntent_iff_exists_concept, Concept.intent_min, Concept.leftInverse_ofAttributes_extent, Concept.intent_sInf, Concept.surjective_ofObjects, Concept.extent_sup, Concept.ofObjects_le_iff, Concept.strictAnti_intent, Concept.isExtent_iff_exists_concept, Concept.extent_max, Concept.le_ofAttributes_iff, Concept.swap_lt_swap_iff, Concept.intent_top, Concept.ofObject_le_ofAttribute_iff, Concept.extent_top, Concept.extent_inf, Concept.leftInvOn_extent_ofObjects, Concept.strictMono_extent, Concept.leftInverse_ofObjects_extent, Concept.le_ofObjects_of_extent_subset, Concept.swapEquiv_symm_apply, Concept.extent_ssubset_extent_iff, Concept.extent_bot, Concept.extent_sInf, Concept.intent_injective
extentClosure πŸ“–CompOp
2 mathmath: extentClosure_apply, extentClosure_isClosed
intentClosure πŸ“–CompOp
2 mathmath: intentClosure_isClosed, intentClosure_apply
lowerPolar πŸ“–CompOp
40 mathmath: lowerPolar_swap, lowerPolar_union, Order.IsExtent.eq, Concept.lowerPolar_intent, Order.isExtent_iff, Concept.extent_sSup, lowerPolar_anti, extentClosure_apply, lowerPolar_iUnionβ‚‚, subset_upperPolar_lowerPolar, gc_upperPolar_lowerPolar, lowerPolar_empty, mem_lowerPolar_singleton, subset_lowerPolar_upperPolar, Order.IsExtent.lowerPolar_upperPolar_subset, upperPolar_lowerPolar_upperPolar, lowerPolar_upperPolar_monotone, Concept.extent_iSup, Concept.extent_ofObjects, Concept.extent_ofAttributes, Concept.intent_ofAttributes, lowerPolar_iUnion, intentClosure_isClosed, Order.isIntent_iff, Concept.extent_sup, intentClosure_apply, lowerPolar_le, Concept.extent_max, Order.IsIntent.eq, Concept.extent_ofIsIntent, lowerPolar_upperPolar_lowerPolar, upperPolar_swap, extentClosure_isClosed, upperPolar_lowerPolar_monotone, Concept.extent_bot, Order.isExtent_lowerPolar, Order.IsIntent.upperPolar_lowerPolar_subset, gc_lowerPolar_upperPolar, mem_lowerPolar_iff, subset_upperPolar_iff_subset_lowerPolar
upperPolar πŸ“–CompOp
40 mathmath: lowerPolar_swap, Order.IsExtent.eq, Concept.intent_ofIsExtent, Order.isExtent_iff, mem_upperPolar_iff, extentClosure_apply, mem_upperPolar_singleton, subset_upperPolar_lowerPolar, Concept.intent_iInf, Concept.intent_inf, gc_upperPolar_lowerPolar, upperPolar_union, upperPolar_empty, subset_lowerPolar_upperPolar, Concept.intent_ofObjects, Order.IsExtent.lowerPolar_upperPolar_subset, upperPolar_lowerPolar_upperPolar, lowerPolar_upperPolar_monotone, Concept.extent_ofObjects, upperPolar_le, Concept.intent_ofAttributes, intentClosure_isClosed, Concept.intent_min, Order.isIntent_iff, Concept.intent_sInf, intentClosure_apply, upperPolar_iUnionβ‚‚, Concept.intent_top, Order.IsIntent.eq, Order.isIntent_upperPolar, lowerPolar_upperPolar_lowerPolar, upperPolar_anti, upperPolar_swap, extentClosure_isClosed, Concept.upperPolar_extent, upperPolar_lowerPolar_monotone, Order.IsIntent.upperPolar_lowerPolar_subset, gc_lowerPolar_upperPolar, subset_upperPolar_iff_subset_lowerPolar, upperPolar_iUnion

Theorems

NameKindAssumesProvesValidatesDepends On
extentClosure_apply πŸ“–mathematicalβ€”DFunLike.coe
ClosureOperator
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
ClosureOperator.instFunLike
extentClosure
lowerPolar
upperPolar
β€”β€”
extentClosure_isClosed πŸ“–mathematicalβ€”ClosureOperator.IsClosed
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
extentClosure
lowerPolar
upperPolar
β€”β€”
gc_lowerPolar_upperPolar πŸ“–mathematicalβ€”GaloisConnection
Set
OrderDual
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
OrderDual.instPreorder
DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
OrderDual.toDual
lowerPolar
upperPolar
OrderDual.ofDual
β€”subset_upperPolar_iff_subset_lowerPolar
gc_upperPolar_lowerPolar πŸ“–mathematicalβ€”GaloisConnection
Set
OrderDual
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
OrderDual.instPreorder
DFunLike.coe
Equiv
EquivLike.toFunLike
Equiv.instEquivLike
OrderDual.toDual
upperPolar
lowerPolar
OrderDual.ofDual
β€”subset_upperPolar_iff_subset_lowerPolar
intentClosure_apply πŸ“–mathematicalβ€”DFunLike.coe
ClosureOperator
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
ClosureOperator.instFunLike
intentClosure
upperPolar
lowerPolar
β€”β€”
intentClosure_isClosed πŸ“–mathematicalβ€”ClosureOperator.IsClosed
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
intentClosure
upperPolar
lowerPolar
β€”β€”
lowerPolar_anti πŸ“–mathematicalβ€”Antitone
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
lowerPolar
β€”upperPolar_anti
lowerPolar_empty πŸ“–mathematicalβ€”lowerPolar
Set
Set.instEmptyCollection
Set.univ
β€”upperPolar_empty
lowerPolar_iUnion πŸ“–mathematicalβ€”lowerPolar
Set.iUnion
Set.iInter
β€”upperPolar_iUnion
lowerPolar_iUnionβ‚‚ πŸ“–mathematicalβ€”lowerPolar
Set.iUnion
Set.iInter
β€”upperPolar_iUnionβ‚‚
lowerPolar_le πŸ“–mathematicalβ€”lowerPolar
lowerBounds
β€”β€”
lowerPolar_swap πŸ“–mathematicalβ€”lowerPolar
Function.swap
upperPolar
β€”β€”
lowerPolar_union πŸ“–mathematicalβ€”lowerPolar
Set
Set.instUnion
Set.instInter
β€”upperPolar_union
lowerPolar_upperPolar_lowerPolar πŸ“–mathematicalβ€”lowerPolar
upperPolar
β€”upperPolar_lowerPolar_upperPolar
lowerPolar_upperPolar_monotone πŸ“–mathematicalβ€”Monotone
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
lowerPolar
upperPolar
β€”GaloisConnection.monotone_u_comp_l
gc_upperPolar_lowerPolar
mem_lowerPolar_iff πŸ“–mathematicalβ€”Set
Set.instMembership
lowerPolar
β€”β€”
mem_lowerPolar_singleton πŸ“–mathematicalβ€”Set
Set.instMembership
lowerPolar
Set.instSingletonSet
β€”β€”
mem_upperPolar_iff πŸ“–mathematicalβ€”Set
Set.instMembership
upperPolar
β€”β€”
mem_upperPolar_singleton πŸ“–mathematicalβ€”Set
Set.instMembership
upperPolar
Set.instSingletonSet
β€”β€”
subset_lowerPolar_upperPolar πŸ“–mathematicalβ€”Set
Set.instHasSubset
lowerPolar
upperPolar
β€”GaloisConnection.le_u_l
gc_upperPolar_lowerPolar
subset_upperPolar_iff_subset_lowerPolar πŸ“–mathematicalβ€”Set
Set.instHasSubset
upperPolar
lowerPolar
β€”β€”
subset_upperPolar_lowerPolar πŸ“–mathematicalβ€”Set
Set.instHasSubset
upperPolar
lowerPolar
β€”subset_lowerPolar_upperPolar
upperPolar_anti πŸ“–mathematicalβ€”Antitone
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
upperPolar
β€”GaloisConnection.monotone_l
gc_upperPolar_lowerPolar
upperPolar_empty πŸ“–mathematicalβ€”upperPolar
Set
Set.instEmptyCollection
Set.univ
β€”Set.eq_univ_of_forall
upperPolar_iUnion πŸ“–mathematicalβ€”upperPolar
Set.iUnion
Set.iInter
β€”GaloisConnection.l_iSup
gc_upperPolar_lowerPolar
upperPolar_iUnionβ‚‚ πŸ“–mathematicalβ€”upperPolar
Set.iUnion
Set.iInter
β€”GaloisConnection.l_iSupβ‚‚
gc_upperPolar_lowerPolar
upperPolar_le πŸ“–mathematicalβ€”upperPolar
upperBounds
β€”β€”
upperPolar_lowerPolar_monotone πŸ“–mathematicalβ€”Monotone
Set
PartialOrder.toPreorder
CompleteSemilatticeInf.toPartialOrder
CompleteLattice.toCompleteSemilatticeInf
CompleteBooleanAlgebra.toCompleteLattice
CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra
Set.instCompleteAtomicBooleanAlgebra
upperPolar
lowerPolar
β€”GaloisConnection.monotone_u_comp_l
gc_lowerPolar_upperPolar
upperPolar_lowerPolar_upperPolar πŸ“–mathematicalβ€”upperPolar
lowerPolar
β€”GaloisConnection.l_u_l_eq_l
gc_upperPolar_lowerPolar
upperPolar_swap πŸ“–mathematicalβ€”upperPolar
Function.swap
lowerPolar
β€”β€”
upperPolar_union πŸ“–mathematicalβ€”upperPolar
Set
Set.instUnion
Set.instInter
β€”Set.ext
forallβ‚‚_or_left

---

← Back to Index