Theorems · Definition · order theory
Set.codRestrict
{α : Type u_1} → {ι : Sort u_5} → (f : ι → α) → (s : Set α) → (∀ (x : ι), f x ∈ s) → ι → ↑sRestrict codomain of a function f to a set s. Same as Subtype.coind but this version
has codomain ↥s instead of Subtype s.
- Defined in
- Mathlib.Data.Set.Restrict
- Cited by
- 48 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
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.
Cited by51
Results whose statement or proof uses this declaration.
- Real.expOrderIsoproof · cited by 12
- Continuous.codRestrictstatement · cited by 11
- Set.injective_codRestrictstatement · cited by 10
- Topology.IsEmbedding.aestronglyMeasurable_comp_iffproof · cited by 6
- Function.Injective.codRestrictstatement · cited by 5
- cfc_compproof · cited by 5
- Set.not_injOn_infinite_finite_imageproof · cited by 4
- cfcₙ_compproof · cited by 3
- ContinuousAt.codRestrictstatement · cited by 3
- AlgebraicIndependent.mapproof · cited by 3
- Topology.IsEmbedding.codRestrictstatement · cited by 3
- Equiv.Perm.exists_extending_pairproof · cited by 2