Theorems · Theorem · combinatorics
Finset.forall_mem_const
∀ {α : Type u_1} {s : Finset α} [Nonempty ↥s] {p : Prop}, (∀ x ∈ s, p) ↔ p- Defined in
- Mathlib.Data.Finset.Empty
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
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.nonempty_coe_sortproof · cited by 6
- Finset.Nonempty.forall_constproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.