Theorem redivcan2d

Description: A cancellation law for division. (Contributed by SN, 25-Nov-2025)

	Ref	Expression
Hypotheses	redivcan2d.a	$$⊢\phi \to A\in ℝ$$
	redivcan2d.b	$$⊢\phi \to B\in ℝ$$
	redivcan2d.z	$$⊢\phi \to B\ne 0$$
Assertion	redivcan2d	Could not format assertion : No typesetting found for |- ( ph -> ( B x. ( A /R B ) ) = A ) with typecode |-

Proof

Step	Hyp	Ref	Expression
1		redivcan2d.a	$$⊢\phi \to A\in ℝ$$
2		redivcan2d.b	$$⊢\phi \to B\in ℝ$$
3		redivcan2d.z	$$⊢\phi \to B\ne 0$$
4		eqidd	Could not format ( ph -> ( A /R B ) = ( A /R B ) ) : No typesetting found for |- ( ph -> ( A /R B ) = ( A /R B ) ) with typecode |-
5	1 2 3	sn-redivcld	Could not format ( ph -> ( A /R B ) e. RR ) : No typesetting found for |- ( ph -> ( A /R B ) e. RR ) with typecode |-
6	1 5 2 3	redivmuld	Could not format ( ph -> ( ( A /R B ) = ( A /R B ) <-> ( B x. ( A /R B ) ) = A ) ) : No typesetting found for |- ( ph -> ( ( A /R B ) = ( A /R B ) <-> ( B x. ( A /R B ) ) = A ) ) with typecode |-
7	4 6	mpbid	Could not format ( ph -> ( B x. ( A /R B ) ) = A ) : No typesetting found for |- ( ph -> ( B x. ( A /R B ) ) = A ) with typecode |-