proposition: Lemma apCFmult : ∏ x x' y y' : X, x * y ≠ x' * y' -> x ≠ x' ∨ y ≠ y'.
proof: Proof. exact (apCCDRmult (X := ConstructiveField_ConstructiveCommutativeDivisionRig X)). Qed.
imports: UniMath.Algebra.DivisionRig UniMath.Algebra.Domains_and_Fields UniMath.Algebra.Apartness UniMath.MoreFoundations.Tactics