Theorems · Theorem · order theory
Partition.removeBot.congr_simp
∀ {α : Type u_1} {s : α} [inst : CompleteLattice α] (P P_1 : Set α) (e_P : P = P_1) (indep : sSupIndep P)
(hsSup : sSup P = s), Partition.removeBot P indep hsSup = Partition.removeBot P_1 ⋯ ⋯- Defined in
- Mathlib.Order.Partition.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupstatement and proof · cited by 954
- Partitionstatement · cited by 91
- sSupIndepstatement and proof · cited by 39
- Partition.removeBotstatement and proof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.