Theorems · Theorem · combinatorics
Finset.forall_of_forall_cons
∀ {α : Type u_1} {s : Finset α} {a : α} {p : α → Prop} {h : a ∉ s}, (∀ x ∈ Finset.cons a s h, p x) → ∀ x ∈ s, p xUseful in proofs by induction.
- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Finset.consstatement and proof · cited by 221
- Finset.mem_consproof · cited by 35
Cited by5
Results whose statement or proof uses this declaration.
- StrictConvexOn.map_sum_ltproof · cited by 3
- Topology.IsLocallyConstructible.finsetInfproof · cited by 1
- MeasureTheory.MemLp.prodproof · cited by 1
- IsRetrocompact.finsetInfproof · cited by 1
- IsRetrocompact.finsetSupproof · cited by 1