Theorems · Theorem · ring theory
OreLocalization.ore_right_cancel
∀ {R : Type u_1} [inst : Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r₁ r₂ : R) (s : ↥S),
r₁ * ↑s = r₂ * ↑s → ∃ s', ↑s' * r₁ = ↑s' * r₂Common factors on the right can be turned into common factors on the left, a weak form of cancellability.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses no axioms
- Assumes
- MonoidOreLocalization.OreSet
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Monoidstatement and proof · cited by 3,887
- Submonoidstatement and proof · cited by 3,086
- OreLocalization.OreSetstatement and proof · cited by 92
- OreLocalization.OreSet.ore_right_cancelproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- OreLocalization.nonempty_oreSet_iffproof · cited by 0