Theorems · Theorem · combinatorics
Finset.filter_empty
∀ {α : Type u_1} (p : α → Prop) [inst : DecidablePred p], Finset.filter p ∅ = ∅- Defined in
- Mathlib.Data.Finset.Filter
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Finset.filterstatement · cited by 949
- Finset.filter_subsetproof · cited by 55
- Finset.subset_emptyproof · cited by 4
Cited by23
Results whose statement or proof uses this declaration.
- primitiveRoots_zeroproof · cited by 5
- Finpartition.equitabilise_auxproof · cited by 3
- Nat.properDivisors_oneproof · cited by 2
- Rel.interedges_empty_leftproof · cited by 2
- QuadraticMap.map_sumproof · cited by 2
- Finset.prod_add_orderedproof · cited by 2
- PairReduction.card_pairSetSeq_le_logSizeRadius_mulproof · cited by 1
- Finset.addEnergy_empty_leftproof · cited by 1
- Finset.addEnergy_empty_rightproof · cited by 1
- Finset.fold_ite'proof · cited by 1
- Finpartition.isUniformOfEmptyproof · cited by 1
- Behrend.sphere_zero_rightproof · cited by 1