Theorems · Definition · logic and foundations
Set.range
{α : Type u} → {ι : Sort u_1} → (ι → α) → Set αRange of a function.
This function is more flexible than f '' univ, as the image requires that the domain is in Type
and not an arbitrary Sort.
- Defined in
- Mathlib.Data.Set.Operations
- Cited by
- 4,705 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 5 definitions · 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.
- Setstatement · cited by 53,352
- Set.ofPredproof · cited by 6,101
Cited by5,080
Results whose statement or proof uses this declaration.
- iSupproof · cited by 2,415
- iInfproof · cited by 1,690
- LinearMap.rangeproof · cited by 893
- Algebra.adjoinproof · cited by 535
- AddSubgroup.zmultiplesproof · cited by 493
- Submonoid.powersproof · cited by 408
- IntermediateField.adjoinproof · cited by 382
- Set.mem_range_selfstatement · cited by 328
- Set.image_univstatement · cited by 322
- MonoidHom.rangeproof · cited by 314
- Set.range_compstatement and proof · cited by 223
- Subgroup.zpowersproof · cited by 204
Showing the 200 most cited of 5,080.