Notation #
This file defines notation and abbreviations used throughout the library.
Notation for the top element of an order with top (Top.top). In our context, it represents the
index of an $\omega$-category in ℕ∞.
Equations
- HigherCategoryTheory.termω = Lean.ParserDescr.node `HigherCategoryTheory.termω 1024 (Lean.ParserDescr.symbol "ω")
Instances For
Notation for the injection into a WithTop type (WithTop.some). In our context, it represents
the index of an $n$-category in ℕ∞.
Equations
- HigherCategoryTheory.termFin = Lean.ParserDescr.node `HigherCategoryTheory.termFin 1024 (Lean.ParserDescr.symbol "fin")
Instances For
Abbreviation for Fin (n + 1), used as the index type for $n$-categories in the many-sorted
presentation.
Equations
- HigherCategoryTheory.FinSucc n = Fin (n + 1)
Instances For
A family of types indexed by a preordered type, used as the carrier for many-sorted categories.
Equations
- HigherCategoryTheory.TypeFamily Index = (Index → Type ?u.7)
Instances For
A family of types indexed by FinSucc n, used as the carrier for many-sorted $n$-categories.
Equations
Instances For
A family of types indexed by ℕ, used as the carrier for many-sorted $\omega$-categories.
Instances For
Notation for lt_trans, used to compose strict inequality proofs when passing index arguments
to source, target, or composition operations in the many-sorted presentation. In any other context,
prefer using lt_trans directly.
Equations
- One or more equations did not get rendered due to their size.