Theorems · Theorem · order theory
Finset.insert_inter
∀ {α : Type u_1} [inst : DecidableEq α] {s₁ s₂ : Finset α} {a : α},
s₁ ∩ insert a s₂ = if a ∈ s₁ then insert a (s₁ ∩ s₂) else s₁ ∩ s₂- Defined in
- Mathlib.Data.Finset.Lattice.Lemmas
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 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.
Cites3
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.inter_insert_of_notMemproof · cited by 5
- Finset.inter_insert_of_memproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.