Theorems · Theorem · combinatorics
Set.sups_assoc
∀ {α : Type u_2} [inst : SemilatticeSup α] (s t u : Set α), s ⊻ t ⊻ u = s ⊻ (t ⊻ u)- Defined in
- Mathlib.Data.Set.Sups
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeSup
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
- SemilatticeSupstatement and proof · cited by 785
- HasSups.supsstatement · cited by 103
- Set.hasSupsstatement · cited by 43
- sup_assocproof · cited by 37
- Set.image2_assocproof · cited by 6
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.