Theorems · Definition · commutative algebra
FreeCommRing.restriction
{α : Type u} → (s : Set α) → [DecidablePred fun x => x ∈ s] → FreeCommRing α →+* FreeCommRing ↑sThe restriction map from FreeCommRing α to FreeCommRing s where s : Set α, defined
by sending all variables not in s to zero.
- Defined in
- Mathlib.RingTheory.FreeCommRing
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- RingHomstatement · cited by 10,189
- Set.Elemstatement · cited by 7,166
- FreeCommRingstatement · cited by 43
- FreeCommRing.ofproof · cited by 34
- FreeCommRing.liftproof · cited by 10
Cited by2
Results whose statement or proof uses this declaration.
- FreeCommRing.restriction_ofstatement · cited by 1
- FreeCommRing.map_subtype_val_restrictionstatement and proof · cited by 0