Theorems · Theorem · order theory
sSupHom.cancel_left
∀ {α : Type u_2} {β : Type u_3} {γ : Type u_4} [inst : SupSet α] [inst_1 : SupSet β] [inst_2 : SupSet γ]
{g : sSupHom β γ} {f₁ f₂ : sSupHom α β}, Function.Injective ⇑g → (g.comp f₁ = g.comp f₂ ↔ f₁ = f₂)- Defined in
- Mathlib.Order.Hom.CompleteLattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- SupSetstatement and proof · cited by 154
- sSupHomstatement and proof · cited by 40
- sSupHom.compstatement and proof · cited by 11
- sSupHom.extproof · cited by 5
- sSupHom.comp_applyproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.