Theorems · Theorem · order theory
Subtype.range_coe_subtype
∀ {α : Type u_1} {p : α → Prop}, Set.range Subtype.val = {x | p x}We make this the simp lemma instead of range_coe. The reason is that if we write
for s : Set α the function (↑) : s → α, then the inferred implicit arguments of (↑) are
↑α (fun x ↦ x ∈ s).
- Defined in
- Mathlib.Data.Set.Image
- Cited by
- 170 results in Mathlib
- Foundations
- Depth 18 from the axioms, rests on 77 definitions · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.ofPredstatement · cited by 6,101
- Set.rangestatement · cited by 4,705
- Subtype.range_coeproof · cited by 98
Cited by170
Results whose statement or proof uses this declaration.
- Submodule.eq_top_of_finrank_eqproof · cited by 15
- Finset.range_orderEmbOfFinproof · cited by 9
- Topology.IsConstructible.isLocallyConstructibleproof · cited by 7
- tsum_subtype_eq_of_support_subsetproof · cited by 7
- Set.iUnion_of_singleton_coeproof · cited by 6
- Algebra.FiniteType.isNoetherianRingproof · cited by 6
- LinearMap.exists_leftInverse_of_injectiveproof · cited by 6
- Set.image_subtype_val_Iocproof · cited by 5
- tprod_subtype_eq_of_mulSupport_subsetproof · cited by 5
- ZLattice.rankproof · cited by 5
- linearIndepOn_insertproof · cited by 4
- Set.image_subtype_val_Iccproof · cited by 4