Mathlib Map

Theorems · Theorem · combinatorics

Finset.mem_singleton_self

∀ {α : Type u_1} (a : α), a ∈ {a}
Defined in
Mathlib.Data.Finset.Insert
Cited by
44 results in Mathlib
Foundations
Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Finset.singleton_nonempty · cited by 15Finset.singleton_nonemptyFinset.singleton_injective · cited by 14Finset.singleton_injectiveFinset.exists_mem_eq_sup' · cited by 9Finset.exists_mem_eq_sup'ProbabilityTheory.Kernel.iIndepFun.indepFun_prodMk · cited by 7iIndepFun.indepFun_prodMkProbabilityTheory.Kernel.iIndepFun.indepFun_prodMk_prodMk · cited by 6iIndepFun.indepFun_prodMk…ProbabilityTheory.Kernel.iIndepFun.indepFun_finsetProd_of_notMem · cited by 5iIndepFun.indepFun_finset…ProbabilityTheory.Kernel.iIndepFun.indepFun_finsetSum_of_notMem · cited by 5iIndepFun.indepFun_finset…MeasureTheory.generateFrom_measurableCylinders · cited by 5MeasureTheory.generateFro…Polynomial.support_trinomial_subset · cited by 5Polynomial.support_trinom…Filter.tendsto_finset_preimage_atTop_atTop · cited by 4Filter.tendsto_finset_pre…FirstOrder.Language.Theory.isSatisfiable_iff_isFinitelySatisfiable · cited by 3Theory.isSatisfiable_iff_…partialSups_succ · cited by 3partialSups_succFinpartition.equitabilise_aux · cited by 3Finpartition.equitabilise…Finset.zero_mem_zero · cited by 3Finset.zero_mem_zeroTuring.PartrecToTM2.trStmts₁_self · cited by 3PartrecToTM2.trStmts₁_selfFinset · cited by 13712FinsetFinset.mem_singleton · cited by 103Finset.mem_singletonFinset.mem_singleton_selfCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by44

Results whose statement or proof uses this declaration.