Theorems · Theorem · order theory
Finsupp.embDomain_le_embDomain_iff_le
∀ {ι : Type u_1} {κ : Type u_2} {α : Type u_3} [inst : Zero α] [inst_1 : LE α] [Std.Refl fun x1 x2 => x1 ≤ x2]
(f : ι ↪ κ) (g₁ g₂ : ι →₀ α), Finsupp.embDomain f g₁ ≤ Finsupp.embDomain f g₂ ↔ g₁ ≤ g₂- Defined in
- Mathlib.Data.Finsupp.Order
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsuppstatement and proof · cited by 5,255
- Function.Embeddingstatement and proof · cited by 988
- Finsupp.embDomainstatement and proof · cited by 69
- Classical.choose_eqproof · cited by 15
- Finsupp.embDomain_applyproof · cited by 8
- apply_dite₂proof · cited by 6
- Finsupp.le_defproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Finsupp.embDomain_monoproof · cited by 0
- Finsupp.mapDomain_le_mapDomain_iff_leproof · cited by 0