ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpundi GIF version

Theorem xpundi 4414
Description: Distributive law for cross 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 4369 . 2 (𝐴 × (𝐵𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))}
2 df-xp 4369 . . . 4 (𝐴 × 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)}
3 df-xp 4369 . . . 4 (𝐴 × 𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)}
42, 3uneq12i 3124 . . 3 ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)})
5 elun 3113 . . . . . . 7 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
65anbi2i 444 . . . . . 6 ((𝑥𝐴𝑦 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝑦𝐶)))
7 andi 764 . . . . . 6 ((𝑥𝐴 ∧ (𝑦𝐵𝑦𝐶)) ↔ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶)))
86, 7bitri 182 . . . . 5 ((𝑥𝐴𝑦 ∈ (𝐵𝐶)) ↔ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶)))
98opabbii 3845 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶))}
10 unopab 3857 . . . 4 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∨ (𝑥𝐴𝑦𝐶))}
119, 10eqtr4i 2104 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))} = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐶)})
124, 11eqtr4i 2104 . 2 ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 ∈ (𝐵𝐶))}
131, 12eqtr4i 2104 1 (𝐴 × (𝐵𝐶)) = ((𝐴 × 𝐵) ∪ (𝐴 × 𝐶))
Colors of variables: wff set class
Syntax hints:  wa 102  wo 661   = wceq 1284  wcel 1433  cun 2971  {copab 3838   × cxp 4361
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-opab 3840  df-xp 4369
This theorem is referenced by:  xpun  4419
  Copyright terms: Public domain W3C validator