[Merged by Bors] - feat(BooleanSubalgebra): closure of supClosed+infClosed set containing bot+top

[alreadydone]

Every element in the closure of such a set s can be written as a finite sup of elements of the form a \ b with a, b in s.

---

[github-actions]

PR summary cccb6fe160

Import changes for modified files

No significant changes to the import graph

Import changes for all files

Files	Import difference

---

Declarations diff

+ closure_sdiff_sup_induction
+ mem_closure_iff_sup_sdiff

You can run this locally as follows

## summary with just the declaration names:
./scripts/declarations_diff.sh <optional_commit>

## more verbose report:
./scripts/declarations_diff.sh long <optional_commit>

The doc-module for script/declarations_diff.sh contains some details about this script.

---

No changes to technical debt.

You can run this locally as

./scripts/technical-debt-metrics.sh pr_summary

• The relative value is the weighted sum of the differences with weight given by the inverse of the current value of the statistic.
• The absolute value is the relative value divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).

[YaelDillies]

Thank you for sorting this out!

[YaelDillies]

Can we also have the dual versions using himp?

[alreadydone]

Can we also have the dual versions using himp?

Is it useful? closure_bot_sup_induction didn't have a top_inf counterpart. Maybe you can try to use the dual Boolean algebra to prove it?

[YaelDillies]

maintainer merge

Thanks!

[github-actions]

🚀 Pull request has been placed on the maintainer queue by YaelDillies.

[jcommelin]

Thanks 🎉

bors merge

[mathlib-bors]

Pull request successfully merged into master.

Build succeeded!

And happy new year! 🎉

• Lint style
• Build