feat(Order/UpperLower/Closure): the upper and lower closures of a maximal antichain cover the order - #42590
Conversation
Welcome new contributor!Thank you for contributing to Mathlib! If you haven't done so already, please review our contribution guidelines, as well as the style guide and naming conventions. In particular, we kindly remind contributors that we have guidelines regarding the use of AI when making pull requests. We use a review queue to manage reviews. If your PR does not appear there, it is probably because it is not successfully building (i.e., it doesn't have a green checkmark), has the If you haven't already done so, please come to https://leanprover.zulipchat.com/, introduce yourself, and mention your new PR. Thank you again for joining our community. |
PR summary aa2bd7c434Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
easy |
I add
IsMaxAntichain.upperClosure_union_lowerClosure. It says that the upper and lower closures of a maximal antichain cover the whole order.I put it right after
ordConnected_iff_upperClosure_inter_lowerClosure, next toupperClosure_inter_lowerClosure, which seems the right spot.The lemma is about antichains, so
Mathlib/Order/Antichain.leanwould have looked like the natural file to modify, butupperClosureis defined inMathlib/Order/UpperLower/Closure.lean, which importsMathlib.Order.Interval.Set.OrdConnected, which importsMathlib.Order.Antichain. So to avoid an import loop I put it inClosure.lean.I split this out of #40741, where a reviewer suggested it. Nothing in that PR uses the lemma.