Theorems · Theorem · order theory
Function.invFunOn_mem
∀ {α : Type u_1} {β : Type u_2} {s : Set α} {f : α → β} {b : β} [inst : Nonempty α],
(∃ a ∈ s, f a = b) → Function.invFunOn f s b ∈ s- Defined in
- Mathlib.Data.Set.Function
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Nonempty
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.
- Setstatement and proof · cited by 53,352
- Function.invFunOnstatement · cited by 35
- Function.invFunOn_posproof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- Set.SurjOn.mapsTo_invFunOnproof · cited by 7
- Function.invFunOn_apply_memproof · cited by 2
- Finsupp.lmapDomain_supportedproof · cited by 2
- Finset.card_nsmul_quotient_add_nsmul_inter_addSubgroup_leproof · cited by 0
- Finset.card_pow_quotient_mul_pow_inter_subgroup_leproof · cited by 0