Theorem unixp 6284

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 5677	. . 3 ⊢ Rel (𝐴 × 𝐵)
2		relfld 6276	. . 3 ⊢ (Rel (𝐴 × 𝐵) → ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)))
3	1, 2	ax-mp 5	. 2 ⊢ ∪ ∪ (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵))
4		xpeq2 5680	. . . . 5 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅))
5		xp0 5759	. . . . 5 ⊢ (𝐴 × ∅) = ∅
6	4, 5	eqtrdi 2813	. . . 4 ⊢ (𝐵 = ∅ → (𝐴 × 𝐵) = ∅)
7	6	necon3i 2989	. . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅)
8		xpeq1 5673	. . . . 5 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵))
9		0xp 5758	. . . . 5 ⊢ (∅ × 𝐵) = ∅
10	8, 9	eqtrdi 2813	. . . 4 ⊢ (𝐴 = ∅ → (𝐴 × 𝐵) = ∅)
11	10	necon3i 2989	. . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅)
12		dmxp 5917	. . . 4 ⊢ (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
13		rnxp 6167	. . . 4 ⊢ (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
14		uneq12 4113	. . . 4 ⊢ ((dom (𝐴 × 𝐵) = 𝐴 ∧ ran (𝐴 × 𝐵) = 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
15	12, 13, 14	syl2an 608	. . 3 ⊢ ((𝐵 ≠ ∅ ∧ 𝐴 ≠ ∅) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
16	7, 11, 15	syl2anc 596	. 2 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴 ∪ 𝐵))
17	3, 16	eqtrid 2809	1 ⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ≠ wne 2957   ∪ cun 3900  ∅c0 4282  ∪ cuni 4870   × cxp 5657  dom cdm 5659  ran crn 5660  Rel wrel 5664

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670

This theorem is used by:  unixpid  6286  rankxpl  9860  rankxplim2  9865  rankxplim3  9866  rankxpsuc  9867