Theorems · Definition · order theory
Finset.compls
{α : Type u_2} → [BooleanAlgebra α] → Finset α → Finset αsᶜˢ is the finset of elements of the form aᶜ where a ∈ s.
- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 34 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Compl.complproof · cited by 2,925
- Finset.mapproof · cited by 747
- BooleanAlgebrastatement and proof · cited by 300
- compl_injectiveproof · cited by 22
Cited by34
Results whose statement or proof uses this declaration.
- Finset.compls_complsstatement · cited by 5
- Finset.infs_compls_eq_diffsstatement · cited by 3
- Set.Sized.complsstatement · cited by 2
- Finset.compls_nonemptystatement · cited by 2
- Finset.card_complsstatement · cited by 2
- AhlswedeZhang.infSum_compls_add_supSumstatement and proof · cited by 1
- Finset.le_card_diffs_mul_card_diffsproof · cited by 1
- Finset.forall_mem_complsstatement · cited by 1
- Finset.Nonempty.complsstatement · cited by 1
- Finset.compls_infs_eq_diffsstatement and proof · cited by 1
- Finset.compls_subset_complsstatement · cited by 1
- Finset.coe_complsstatement · cited by 1