Theorems · Theorem · order theory
Finset.exists
∀ {α : Type u} {p : Finset α → Prop}, (∃ s, p s) ↔ ∃ s, ∃ (hs : s.Finite), p hs.toFinset- Defined in
- Mathlib.Data.Set.Finite.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.Finitestatement and proof · cited by 1,814
- Set.Finite.toFinsetstatement and proof · cited by 351
- Finset.finite_toSetproof · cited by 210
- Finset.toFinset_coeproof · cited by 16
- Set.toFinite_toFinsetproof · cited by 13
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.