Theorems · Theorem · combinatorics
Finset.Nonempty.forall_const
∀ {α : Type u_1} {s : Finset α}, s.Nonempty → ∀ {p : Prop}, (∀ x ∈ s, p) ↔ p- Defined in
- Mathlib.Data.Finset.Empty
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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.Nonemptystatement and proof · cited by 1,001
Cited by3
Results whose statement or proof uses this declaration.
- Finset.sup_constproof · cited by 5
- Finset.inf_constproof · cited by 1
- Finset.forall_mem_constproof · cited by 0