Theorems · Theorem · order theory
Finset.singleton_inter_of_notMem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Finset α}, a ∉ s → {a} ∩ s = ∅- Defined in
- Mathlib.Data.Finset.Lattice.Lemmas
- Cited by
- 2 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.
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.eq_empty_of_forall_notMemproof · cited by 6
Cited by2
Results whose statement or proof uses this declaration.
- Finset.inter_singleton_of_notMemproof · cited by 3
- Finset.singleton_interproof · cited by 0