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

Theorem xpun 5333
Description: The Cartesian product of two unions. (Contributed by NM, 12-Aug-2004.)
Assertion
Ref Expression
xpun ((𝐴𝐵) × (𝐶𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷)))

Proof of Theorem xpun
StepHypRef Expression
1 xpundi 5328 . 2 ((𝐴𝐵) × (𝐶𝐷)) = (((𝐴𝐵) × 𝐶) ∪ ((𝐴𝐵) × 𝐷))
2 xpundir 5329 . . 3 ((𝐴𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶))
3 xpundir 5329 . . 3 ((𝐴𝐵) × 𝐷) = ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))
42, 3uneq12i 3908 . 2 (((𝐴𝐵) × 𝐶) ∪ ((𝐴𝐵) × 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷)))
5 un4 3916 . 2 (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷)))
61, 4, 53eqtri 2786 1 ((𝐴𝐵) × (𝐶𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷)))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1632  cun 3713   × cxp 5264
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-v 3342  df-un 3720  df-opab 4865  df-xp 5272
This theorem is referenced by:  ex-xp  27604
  Copyright terms: Public domain W3C validator