Theorems · Theorem · order theory
Finsupp.mapDomain_tsub
∀ {ι : Type u_1} {κ : Type u_2} {α : Type u_3} [inst : AddCommMonoid α] [inst_1 : PartialOrder α]
[inst_2 : CanonicallyOrderedAdd α] [inst_3 : Sub α] [inst_4 : OrderedSub α] {f : ι → κ},
Function.Injective f →
∀ (f1 f2 : ι →₀ α), Finsupp.mapDomain f (f1 - f2) = Finsupp.mapDomain f f1 - Finsupp.mapDomain f f2- Defined in
- Mathlib.Data.Finsupp.Order
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- AddCommMonoidstatement and proof · cited by 12,281
- PartialOrderstatement and proof · cited by 6,410
- Finsuppstatement and proof · cited by 5,255
- Set.rangeproof · cited by 4,705
- Finsupp.extproof · cited by 399
- OrderedSubstatement and proof · cited by 236
- CanonicallyOrderedAddstatement and proof · cited by 229
- Finsupp.mapDomainstatement · cited by 168
- tsub_selfproof · cited by 154
- Finsupp.mapDomain_applyproof · cited by 11
- Finsupp.mapDomain_of_notMem_rangeproof · cited by 7
Cited by1
Results whose statement or proof uses this declaration.
- Finsupp.embDomain_tsubproof · cited by 0