Theorems · Theorem · combinatorics
Finset.forall_mem_insert
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (s : Finset α) (p : α → Prop),
(∀ x ∈ insert a s, p x) ↔ p a ∧ ∀ x ∈ s, p x- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
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
Cited by19
Results whose statement or proof uses this declaration.
- Finset.sum_eq_zero_iff_of_nonnegproof · cited by 19
- Valuation.map_sum_ltproof · cited by 4
- MeasureTheory.lintegral_finsetSum'proof · cited by 3
- linearIndependent_monoidHomproof · cited by 3
- Finset.prod_eq_one_iff_of_one_le'proof · cited by 3
- IsRelPrime.prod_leftproof · cited by 2
- iteratedDerivWithin_sumproof · cited by 2
- IsRelPrime.prod_left_iffproof · cited by 2
- Valuation.map_sum_leproof · cited by 2
- Finset.sum_eq_sum_iff_of_leproof · cited by 2
- HasMFDerivWithinAt.prodproof · cited by 2
- Finset.prod_add_orderedproof · cited by 2