Theorems · Theorem · order theory
Finset.infs_compls_eq_diffs
∀ {α : Type u_2} [inst : BooleanAlgebra α] [inst_1 : DecidableEq α] (s t : Finset α), s ⊼ t.compls = s.diffs t- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 80 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.
Cites10
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
- Compl.complproof · cited by 2,925
- Finset.extproof · cited by 565
- BooleanAlgebrastatement and proof · cited by 300
- compl_complproof · cited by 229
- HasInfs.infsstatement · cited by 105
- Finset.hasInfsstatement · cited by 62
- Finset.diffsstatement · cited by 37
- Finset.complsstatement · cited by 34
- sdiff_eqproof · cited by 18
Cited by3
Results whose statement or proof uses this declaration.
- Finset.le_card_diffs_mul_card_diffsproof · cited by 1
- Finset.compls_infs_eq_diffsproof · cited by 1
- Finset.diffs_compls_eq_infsproof · cited by 0