Mathlib Map

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.