Theorems · Theorem · order theory
Finset.inter_mem_infs
∀ {α : Type u_2} [inst : DecidableEq α] {𝒜 ℬ : Finset (Finset α)} {s t : Finset α}, s ∈ 𝒜 → t ∈ ℬ → s ∩ t ∈ 𝒜 ⊼ ℬ- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 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.
Cites4
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
- HasInfs.infsstatement · cited by 105
- Finset.hasInfsstatement · cited by 62
- Finset.inf_mem_infsproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- collapse_modularproof · cited by 1