Theorems · Theorem · order theory
Finset.compls_sups
∀ {α : Type u_2} [inst : BooleanAlgebra α] [inst_1 : DecidableEq α] (s t : Finset α),
(s ⊻ t).compls = s.compls ⊼ t.compls- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebraDecidableEq
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
- BooleanAlgebrastatement and proof · cited by 300
- HasInfs.infsstatement and proof · cited by 105
- HasSups.supsstatement and proof · cited by 103
- Finset.hasInfsstatement · cited by 62
- Finset.hasSupsstatement · cited by 61
- Finset.complsstatement · cited by 34
- Finset.image_image₂_distribproof · cited by 9
- compl_supproof · cited by 8
Cited by1
Results whose statement or proof uses this declaration.
- Finset.le_card_diffs_mul_card_diffsproof · cited by 1