Notation classes for set supremum and infimum #
In this file we introduce notation for indexed suprema, infima, unions, and intersections.
Main definitions #
iSup f,iInf f: supremum and infimum of an indexed family of elements, defined assSup (Set.range f)andsInf (Set.range f), respectively;Set.sUnion s,Set.sInter s: same assSup sandsInf s, but works only for sets of sets;Set.iUnion s,Set.iInter s: same asiSup sandiInf s, but works only for indexed families of sets.
Notation #
⨆ i, f i,⨅ i, f i: supremum and infimum of an indexed family, respectively;⋃₀ s,⋂₀ s: union and intersection of a set of sets;⋃ i, s i,⋂ i, s i: union and intersection of an indexed family of sets.
Indexed supremum.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Indexed infimum.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Delaborator for indexed supremum.
Instances For
Delaborator for indexed infimum.
Instances For
Notation for Set.sInter Intersection of a set of sets.
Equations
- Set.«term⋂₀_» = Lean.ParserDescr.node `Set.«term⋂₀_» 110 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "⋂₀ ") (Lean.ParserDescr.cat `term 110))
Instances For
Notation for Set.sUnion. Union of a set of sets.
Equations
- Set.«term⋃₀_» = Lean.ParserDescr.node `Set.«term⋃₀_» 110 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "⋃₀ ") (Lean.ParserDescr.cat `term 110))
Instances For
Notation for Set.iUnion. Indexed union of a family of sets
Equations
- One or more equations did not get rendered due to their size.
Instances For
Notation for Set.iInter. Indexed intersection of a family of sets
Equations
- One or more equations did not get rendered due to their size.
Instances For
Delaborator for indexed unions.
Instances For
Delaborator for indexed intersections.