MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  unixp Structured version   Visualization version   GIF version

Theorem unixp 6229
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
StepHypRef Expression
1 relxp 5632 . . 3 Rel (𝐴 × 𝐵)
2 relfld 6222 . . 3 (Rel (𝐴 × 𝐵) → (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)))
31, 2ax-mp 5 . 2 (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵))
4 xpeq2 5635 . . . . 5 (𝐵 = ∅ → (𝐴 × 𝐵) = (𝐴 × ∅))
5 xp0 5714 . . . . 5 (𝐴 × ∅) = ∅
64, 5eqtrdi 2782 . . . 4 (𝐵 = ∅ → (𝐴 × 𝐵) = ∅)
76necon3i 2960 . . 3 ((𝐴 × 𝐵) ≠ ∅ → 𝐵 ≠ ∅)
8 xpeq1 5628 . . . . 5 (𝐴 = ∅ → (𝐴 × 𝐵) = (∅ × 𝐵))
9 0xp 5713 . . . . 5 (∅ × 𝐵) = ∅
108, 9eqtrdi 2782 . . . 4 (𝐴 = ∅ → (𝐴 × 𝐵) = ∅)
1110necon3i 2960 . . 3 ((𝐴 × 𝐵) ≠ ∅ → 𝐴 ≠ ∅)
12 dmxp 5868 . . . 4 (𝐵 ≠ ∅ → dom (𝐴 × 𝐵) = 𝐴)
13 rnxp 6117 . . . 4 (𝐴 ≠ ∅ → ran (𝐴 × 𝐵) = 𝐵)
14 uneq12 4110 . . . 4 ((dom (𝐴 × 𝐵) = 𝐴 ∧ ran (𝐴 × 𝐵) = 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
1512, 13, 14syl2an 596 . . 3 ((𝐵 ≠ ∅ ∧ 𝐴 ≠ ∅) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
167, 11, 15syl2anc 584 . 2 ((𝐴 × 𝐵) ≠ ∅ → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
173, 16eqtrid 2778 1 ((𝐴 × 𝐵) ≠ ∅ → (𝐴 × 𝐵) = (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wne 2928  cun 3895  c0 4280   cuni 4856   × cxp 5612  dom cdm 5614  ran crn 5615  Rel wrel 5619
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 2113  ax-9 2121  ax-11 2160  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
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 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-xp 5620  df-rel 5621  df-cnv 5622  df-dm 5624  df-rn 5625
This theorem is referenced by:  unixpid  6231  rankxpl  9768  rankxplim2  9773  rankxplim3  9774  rankxpsuc  9775
  Copyright terms: Public domain W3C validator