Theorems · Theorem · general algebraic systems
Finsupp.extendDomain_apply
∀ {α : Type u_1} {M : Type u_12} [inst : Zero M] {P : α → Prop} [inst_1 : DecidablePred P] (f : Subtype P →₀ M) (a : α),
f.extendDomain a = if h : P a then f ⟨a, h⟩ else 0- Defined in
- Mathlib.Data.Finsupp.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ZeroDecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsuppstatement and proof · cited by 5,255
- Finsupp.extendDomainstatement and proof · cited by 11
Cited by4
Results whose statement or proof uses this declaration.
- Finsupp.extendDomain_singleproof · cited by 2
- Finsupp.extendDomain_eq_embDomain_subtypeproof · cited by 0
- Finset.finsuppAntidiagEquiv_symm_apply_applyproof · cited by 0
- Finsupp.extendDomain_subtypeDomainproof · cited by 0