Theorems · Theorem · order theory
Set.Finite.inter_of_left
∀ {α : Type u} {s : Set α}, s.Finite → ∀ (t : Set α), (s ∩ t).Finite- Defined in
- Mathlib.Data.Set.Finite.Basic
- Cited by
- 31 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Setstatement and proof · cited by 53,352
- Set.Finitestatement and proof · cited by 1,814
- Set.inter_subset_leftproof · cited by 360
- Set.Finite.subsetproof · cited by 285
Cited by31
Results whose statement or proof uses this declaration.
- AddMonoidHom.map_finsum_memproof · cited by 5
- Set.ncard_inter_add_ncard_sdiff_eq_ncardproof · cited by 4
- Filter.Tendsto.exists_within_forall_leproof · cited by 3
- Northcott.exists_min_imageproof · cited by 2
- MulAction.IsPreprimitive.is_two_motive_of_is_motiveproof · cited by 2
- Setoid.IsPartition.ncard_eq_finsumproof · cited by 2
- finprod_mem_insert'proof · cited by 2
- finsum_mem_unionproof · cited by 2
- Set.ncard_union_eq_iffproof · cited by 2
- MonoidHom.map_finprod_memproof · cited by 2
- Filter.TotallyBounded.exists_subset_of_memproof · cited by 2
- finprod_mem_unionproof · cited by 2