Theorems · Theorem · order theory
Finset.sdiff_eq_empty_iff_subset
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α}, s \ t = ∅ ↔ s ⊆ t- Defined in
- Mathlib.Data.Finset.SDiff
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 62 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
- sdiff_eq_bot_iffproof · cited by 10
Cited by5
Results whose statement or proof uses this declaration.
- ZLattice.rankproof · cited by 5
- Finpartition.equitabilise_auxproof · cited by 3
- Nat.eq_properDivisors_of_subset_of_sum_eq_sumproof · cited by 2
- Finset.erase_eq_empty_iffproof · cited by 1
- Finset.sdiff_nonemptyproof · cited by 1