Theorem dmrnxp 49024

Description: A Cartesian product is the Cartesian product of its domain and range. (Contributed by Zhi Wang, 30-Oct-2025.)

Assertion

Ref	Expression
dmrnxp	⊢ (𝑅 = (𝐴 × 𝐵) → 𝑅 = (dom 𝑅 × ran 𝑅))

Proof of Theorem dmrnxp

Step	Hyp	Ref	Expression
1		simpl 482	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → 𝑅 = (𝐴 × 𝐵))
2		simpr 484	. . . . . . 7 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → ¬ 𝐴 ≠ ∅)
3		nne 2934	. . . . . . 7 ⊢ (¬ 𝐴 ≠ ∅ ↔ 𝐴 = ∅)
4	2, 3	sylib 218	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → 𝐴 = ∅)
5	4	xpeq1d 5651	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → (𝐴 × 𝐵) = (∅ × 𝐵))
6		0xp 5721	. . . . 5 ⊢ (∅ × 𝐵) = ∅
7	5, 6	eqtrdi 2785	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → (𝐴 × 𝐵) = ∅)
8	1, 7	eqtrd 2769	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → 𝑅 = ∅)
9	8	dmeqd 5852	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → dom 𝑅 = dom ∅)
10		dm0 5867	. . . . . 6 ⊢ dom ∅ = ∅
11	9, 10	eqtrdi 2785	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → dom 𝑅 = ∅)
12	8	rneqd 5885	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → ran 𝑅 = ran ∅)
13		rn0 5873	. . . . . 6 ⊢ ran ∅ = ∅
14	12, 13	eqtrdi 2785	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → ran 𝑅 = ∅)
15	11, 14	xpeq12d 5653	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → (dom 𝑅 × ran 𝑅) = (∅ × ∅))
16		0xp 5721	. . . 4 ⊢ (∅ × ∅) = ∅
17	15, 16	eqtrdi 2785	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → (dom 𝑅 × ran 𝑅) = ∅)
18	8, 17	eqtr4d 2772	. 2 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐴 ≠ ∅) → 𝑅 = (dom 𝑅 × ran 𝑅))
19		simpl 482	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → 𝑅 = (𝐴 × 𝐵))
20		simpr 484	. . . . . . 7 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → ¬ 𝐵 ≠ ∅)
21		nne 2934	. . . . . . 7 ⊢ (¬ 𝐵 ≠ ∅ ↔ 𝐵 = ∅)
22	20, 21	sylib 218	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → 𝐵 = ∅)
23	22	xpeq2d 5652	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → (𝐴 × 𝐵) = (𝐴 × ∅))
24		xp0 5722	. . . . 5 ⊢ (𝐴 × ∅) = ∅
25	23, 24	eqtrdi 2785	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → (𝐴 × 𝐵) = ∅)
26	19, 25	eqtrd 2769	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → 𝑅 = ∅)
27	26	dmeqd 5852	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → dom 𝑅 = dom ∅)
28	27, 10	eqtrdi 2785	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → dom 𝑅 = ∅)
29	26	rneqd 5885	. . . . . 6 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → ran 𝑅 = ran ∅)
30	29, 13	eqtrdi 2785	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → ran 𝑅 = ∅)
31	28, 30	xpeq12d 5653	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → (dom 𝑅 × ran 𝑅) = (∅ × ∅))
32	31, 16	eqtrdi 2785	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → (dom 𝑅 × ran 𝑅) = ∅)
33	26, 32	eqtr4d 2772	. 2 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ ¬ 𝐵 ≠ ∅) → 𝑅 = (dom 𝑅 × ran 𝑅))
34		simpl 482	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → 𝑅 = (𝐴 × 𝐵))
35	34	dmeqd 5852	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → dom 𝑅 = dom (𝐴 × 𝐵))
36		dmxp 5876	. . . . . 6 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
37	36	ad2antll 729	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → dom (𝐴 × 𝐵) = 𝐴)
38	35, 37	eqtrd 2769	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → dom 𝑅 = 𝐴)
39	34	rneqd 5885	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → ran 𝑅 = ran (𝐴 × 𝐵))
40		rnxp 6126	. . . . . 6 ⊢ (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
41	40	ad2antrl 728	. . . . 5 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → ran (𝐴 × 𝐵) = 𝐵)
42	39, 41	eqtrd 2769	. . . 4 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → ran 𝑅 = 𝐵)
43	38, 42	xpeq12d 5653	. . 3 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → (dom 𝑅 × ran 𝑅) = (𝐴 × 𝐵))
44	34, 43	eqtr4d 2772	. 2 ⊢ ((𝑅 = (𝐴 × 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐵 ≠ ∅)) → 𝑅 = (dom 𝑅 × ran 𝑅))
45	18, 33, 44	pm2.61dda 814	1 ⊢ (𝑅 = (𝐴 × 𝐵) → 𝑅 = (dom 𝑅 × ran 𝑅))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ≠ wne 2930  ∅c0 4283   × cxp 5620  dom cdm 5622  ran crn 5623

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-11 2162  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097  df-opab 5159  df-xp 5628  df-rel 5629  df-cnv 5630  df-dm 5632  df-rn 5633

This theorem is referenced by: (None)