Theorems · Definition · ring theory
Graded.subtypeMap
{F : Type u_1} →
{A : Type u_2} →
{B : Type u_3} →
{σ : Type u_4} →
{τ : Type u_5} →
{ι : Type u_6} →
[inst : SetLike σ A] →
[inst_1 : SetLike τ B] →
{𝒜 : ι → σ} →
{ℬ : ι → τ} → [inst_2 : FunLike F A B] → [GradedFunLike F 𝒜 ℬ] → F → (i : ι) → ↥(𝒜 i) → ↥(ℬ i)A graded map descends to a map on each component.
- Defined in
- Mathlib.Data.FunLike.Graded
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
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.
- DFunLike.coeproof · cited by 62,936
- FunLikestatement and proof · cited by 2,560
- SetLikestatement and proof · cited by 1,084
- GradedFunLikestatement and proof · cited by 9
Cited by2
Results whose statement or proof uses this declaration.
- Graded.equivproof · cited by 2
- Graded.equiv_applystatement · cited by 0