Theorems · Theorem · order theory
Finpartition.ofErase_parts
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] [inst_2 : DecidableEq α] {a : α} (parts : Finset α)
(sup_indep : parts.SupIndep id) (sup_parts : parts.sup id = a),
(Finpartition.ofErase parts sup_indep sup_parts).parts = parts.erase ⊥- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LatticeOrderBotDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Bot.botstatement · cited by 4,720
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Finset.supstatement and proof · cited by 530
- Finset.erasestatement · cited by 455
- Finpartition.partsstatement and proof · cited by 184
- Finset.SupIndepstatement and proof · cited by 52
- Finpartition.ofErasestatement and proof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- MeasureTheory.IsSetSemiring.exists_finpartition_sdiffproof · cited by 8