Theorem unixp 6101

Description: The double class union of a nonempty Cartesian product is the union of it members. (Contributed by NM, 17-Sep-2006.)

Assertion

Ref	Expression
unixp	⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵))

Proof of Theorem unixp

Step	Hyp	Ref	Expression
1		relxp 5537	. . 3 ⊢ Rel (𝐴 × 𝐵)
2		relfld 6094	. . 3 ⊢ (Rel (𝐴 × 𝐵) → ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)))
3	1, 2	ax-mp 5	. 2 ⊢ ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵))
4		xpeq2 5540	. . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅))
5		xp0 5982	. . . . 5 ⊢ (𝐴 × ∅) = ∅
6	4, 5	eqtrdi 2849	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅)
7	6	necon3i 3019	. . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅)
8		xpeq1 5533	. . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵))
9		0xp 5613	. . . . 5 ⊢ (∅ × 𝐵) = ∅
10	8, 9	eqtrdi 2849	. . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅)
11	10	necon3i 3019	. . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅)
12		dmxp 5763	. . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
13		rnxp 5994	. . . 4 ⊢ (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
14		uneq12 4085	. . . 4 ⊢ ((dom (𝐴 × 𝐵) = 𝐴 ∧ ran (𝐴 × 𝐵) = 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
15	12, 13, 14	syl2an 598	. . 3 ⊢ ((𝐵 ≠ ∅ ∧ 𝐴 ≠ ∅) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
16	7, 11, 15	syl2anc 587	. 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
17	3, 16	syl5eq 2845	1 ⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵))

Syntax hints:   → wi 4   = wceq 1538   ≠ wne 2987   ∪ cun 3879  ∅c0 4243  ∪ cuni 4800   × cxp 5517  dom cdm 5519  ran crn 5520  Rel wrel 5524

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-xp 5525  df-rel 5526  df-cnv 5527  df-dm 5529  df-rn 5530

This theorem is referenced by:  unixpid  6103  rankxpl  9288  rankxplim2  9293  rankxplim3  9294  rankxpsuc  9295