Theorems · Theorem · order theory
Finsupp.support_inf_union_support_sup
∀ {ι : Type u_1} {M : Type u_2} [inst : Zero M] [inst_1 : Lattice M] (f g : ι →₀ M) [inst_2 : DecidableEq ι],
(f ⊓ g).support ∪ (f ⊔ g).support = f.support ∪ g.support- Defined in
- Mathlib.Order.Preorder.Finsupp
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ZeroLatticeDecidableEq
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
- Finsetstatement · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Finsuppstatement and proof · cited by 5,255
- Compl.complproof · cited by 2,925
- Set.extproof · cited by 2,266
- Latticestatement and proof · cited by 916
- Finsupp.supportstatement and proof · cited by 828
- Finset.coe_injectiveproof · cited by 127
- Finset.coe_unionproof · cited by 78
- Set.compl_unionproof · cited by 30
- compl_injectiveproof · cited by 22
Cited by2
Results whose statement or proof uses this declaration.
- Finsupp.support_sup_union_support_infproof · cited by 0
- Finsupp.card_uIccproof · cited by 0