Theorems · Theorem · order theory
Multiset.map_finset_sup
∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : DecidableEq α] [inst_1 : DecidableEq β] (s : Finset γ)
(f : γ → Multiset β) (g : β → α), Function.Injective g → Multiset.map g (s.sup f) = s.sup (Multiset.map g ∘ f)- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqDecidableEq
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.
- Finsetstatement and proof · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- Multiset.mapstatement and proof · cited by 876
- Finset.supstatement · cited by 530
- Finset.apply_sup_eq_sup_compproof · cited by 11
- Multiset.map_zeroproof · cited by 8
- Multiset.map_unionproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- MvPolynomial.degrees_rename_of_injectiveproof · cited by 1