[Merged by Bors] - feat(CategoryTheory): (co)limits indexed by preorders#20335
[Merged by Bors] - feat(CategoryTheory): (co)limits indexed by preorders#20335
Conversation
PR summary 735af22c80Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
Mathlib/CategoryTheory/Limits/Shapes/Preorder/HasIterationOfShape.lean
Outdated
Show resolved
Hide resolved
The definition of `Functor.IsWellOrderContinuous` is moved to a better place `Limits.Shapes.Preorder.WellOrderContinuous` (see also #20335).
Mathlib/CategoryTheory/Limits/Shapes/Preorder/HasIterationOfShape.lean
Outdated
Show resolved
Hide resolved
|
✌️ joelriou can now approve this pull request. To approve and merge a pull request, simply reply with |
Co-authored-by: Markus Himmel <markus@himmel-villmar.de>
…ape.lean Co-authored-by: Markus Himmel <markus@himmel-villmar.de>
|
Thanks! bors merge |
In this PR, we show very basic results about (co)limits indexed by a preordered type J. `OrderBot J` implies the existence of all limits indexed by `J` (and similarly when `J` has a greatest element). We also introduce the typeclass `HasIterationOfShape C J` which contains the assumptions in order to do constructions by transfinite induction (see #20245 for the application to the small object argument). Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
|
Pull request successfully merged into master. Build succeeded: |
In this PR, we show very basic results about (co)limits indexed by a preordered type J.
OrderBot Jimplies the existence of all limits indexed byJ(and similarly whenJhas a greatest element). We also introduce the typeclassHasIterationOfShape C Jwhich contains the assumptions in order to do constructions by transfinite induction (see #20245 for the application to the small object argument).