Theorems · Definition · order theory
Finpartition.ofErase
{α : Type u_1} →
[inst : Lattice α] →
[inst_1 : OrderBot α] →
[DecidableEq α] → {a : α} → (parts : Finset α) → parts.SupIndep id → parts.sup id = a → Finpartition aA Finpartition constructor which does not insist on ⊥ not being a part.
- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 59 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.
Cites8
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.botproof · 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.eraseproof · cited by 455
- Finpartitionstatement · cited by 199
- Finset.SupIndepstatement and proof · cited by 52
Cited by5
Results whose statement or proof uses this declaration.
- MeasureTheory.IsSetSemiring.exists_finpartition_sdiffproof · cited by 8
- Finpartition.atomiseproof · cited by 7
- Finpartition.avoidproof · cited by 4
- Finpartition.ofErase.congr_simpstatement and proof · cited by 1
- Finpartition.ofErase_partsstatement and proof · cited by 1