Theorems · Theorem · order theory
Finset.mem_union_left
∀ {α : Type u_1} [inst : DecidableEq α] {s : Finset α} {a : α} (t : Finset α), a ∈ s → a ∈ s ∪ t- Defined in
- Mathlib.Data.Finset.Lattice.Basic
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 55 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
- Finset.mem_unionproof · cited by 49
Cited by15
Results whose statement or proof uses this declaration.
- Finset.subset_union_leftproof · cited by 59
- SummationFilter.comap_unconditionalproof · cited by 4
- Turing.PartrecToTM2.ret_supportsproof · cited by 2
- exists_subalgebra_of_fgproof · cited by 1
- Finset.preimage_unionstatement and proof · cited by 1
- Turing.TM2.stmts₁_transproof · cited by 1
- linearIndependent_iffₒₛproof · cited by 1
- ax_grothendieck_of_locally_finiteproof · cited by 1
- mul_eq_mul_prime_prodproof · cited by 1
- UV.shadow_compression_subset_compression_shadowproof · cited by 1
- MultilinearMap.map_sum_finset_auxproof · cited by 1
- TopCat.partialSections.directedproof · cited by 1