Theorems · Theorem · order theory
Finpartition.extend_parts
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : OrderBot α] [inst_2 : IsModularLattice α] [inst_3 : DecidableEq α]
{a b c : α} (P : Finpartition a) (hb : b ≠ ⊥) (hab : Disjoint a b) (hc : a ⊔ b = c),
(P.extend hb hab hc).parts = insert b P.parts- Defined in
- Mathlib.Order.Partition.Finpartition
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
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 · cited by 13,712
- Bot.botstatement and proof · cited by 4,720
- Disjointstatement and proof · cited by 2,201
- OrderBotstatement and proof · cited by 1,055
- Latticestatement and proof · cited by 916
- Finpartitionstatement and proof · cited by 199
- Finpartition.partsstatement and proof · cited by 184
- IsModularLatticestatement and proof · cited by 86
- Finpartition.extendstatement and proof · cited by 5
Cited by3
Results whose statement or proof uses this declaration.
- Finpartition.equitabilise_auxproof · cited by 3
- MeasureTheory.IsSetSemiring.mem_supClosure_iffproof · cited by 2
- Finpartition.parts_extendOfLE_of_ltproof · cited by 1