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

Theorem xpundi 5584
Description: Distributive law for Cartesian product over union. Theorem 103 of [Suppes] p. 52. (Contributed by NM, 12-Aug-2004.)
Assertion
Ref Expression
xpundi (𝐴 × (𝐵𝐶)) = ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶))

Proof of Theorem xpundi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-xp 5525 . 2 (𝐴 × (𝐵𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))}
2 df-xp 5525 . . . 4 (𝐴 × 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)}
3 df-xp 5525 . . . 4 (𝐴 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)}
42, 3uneq12i 4088 . . 3 ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)})
5 elun 4076 . . . . . . 7 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
65anbi2i 625 . . . . . 6 ((𝑥𝐴𝑦 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝑦𝐶)))
7 andi 1005 . . . . . 6 ((𝑥𝐴 ∧ (𝑦𝐵𝑦𝐶)) ↔ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶)))
86, 7bitri 278 . . . . 5 ((𝑥𝐴𝑦 ∈ (𝐵𝐶)) ↔ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶)))
98opabbii 5097 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶))}
10 unopab 5109 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶))}
119, 10eqtr4i 2824 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))} = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)})
124, 11eqtr4i 2824 . 2 ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))}
131, 12eqtr4i 2824 1 (𝐴 × (𝐵𝐶)) = ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wa 399  wo 844   = wceq 1538  wcel 2111  cun 3879  {copab 5092   × cxp 5517
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-12 2175  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-un 3886  df-opab 5093  df-xp 5525
This theorem is referenced by:  xpun  5589  djuassen  9589  xpdjuen  9590  ustund  22827  bj-2upln1upl  34460
  Copyright terms: Public domain W3C validator