Theorems · Theorem · order theory
Finset.inter_eq_left
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α}, s ∩ t = s ↔ s ⊆ t- Defined in
- Mathlib.Data.Finset.Lattice.Basic
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 57 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
- inf_eq_leftproof · cited by 41
Cited by7
Results whose statement or proof uses this declaration.
- Finset.Shatters.exists_supersetproof · cited by 2
- Equiv.Perm.IsCycle.eq_on_support_inter_nonempty_congrproof · cited by 1
- SimpleGraph.map_neighborFinset_induce_of_neighborSet_subsetproof · cited by 1
- addRothNumber_union_leproof · cited by 1
- Finset.addDysonETransform_idemproof · cited by 0
- Finset.mulDysonETransform_idemproof · cited by 0
- mulRothNumber_union_leproof · cited by 0