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

Theorem xpriindi 5776
Description: Distributive law for Cartesian product over relativized indexed intersection. (Contributed by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
xpriindi (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐷(𝑥)

Proof of Theorem xpriindi
StepHypRef Expression
1 iineq1 4959 . . . . . . 7 (𝐴 = ∅ → 𝑥𝐴 𝐵 = 𝑥 ∈ ∅ 𝐵)
2 0iin 5012 . . . . . . 7 𝑥 ∈ ∅ 𝐵 = V
31, 2eqtrdi 2782 . . . . . 6 (𝐴 = ∅ → 𝑥𝐴 𝐵 = V)
43ineq2d 4170 . . . . 5 (𝐴 = ∅ → (𝐷 𝑥𝐴 𝐵) = (𝐷 ∩ V))
5 inv1 4348 . . . . 5 (𝐷 ∩ V) = 𝐷
64, 5eqtrdi 2782 . . . 4 (𝐴 = ∅ → (𝐷 𝑥𝐴 𝐵) = 𝐷)
76xpeq2d 5646 . . 3 (𝐴 = ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = (𝐶 × 𝐷))
8 iineq1 4959 . . . . . 6 (𝐴 = ∅ → 𝑥𝐴 (𝐶 × 𝐵) = 𝑥 ∈ ∅ (𝐶 × 𝐵))
9 0iin 5012 . . . . . 6 𝑥 ∈ ∅ (𝐶 × 𝐵) = V
108, 9eqtrdi 2782 . . . . 5 (𝐴 = ∅ → 𝑥𝐴 (𝐶 × 𝐵) = V)
1110ineq2d 4170 . . . 4 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)) = ((𝐶 × 𝐷) ∩ V))
12 inv1 4348 . . . 4 ((𝐶 × 𝐷) ∩ V) = (𝐶 × 𝐷)
1311, 12eqtrdi 2782 . . 3 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)) = (𝐶 × 𝐷))
147, 13eqtr4d 2769 . 2 (𝐴 = ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
15 xpindi 5773 . . 3 (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ (𝐶 × 𝑥𝐴 𝐵))
16 xpiindi 5775 . . . 4 (𝐴 ≠ ∅ → (𝐶 × 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶 × 𝐵))
1716ineq2d 4170 . . 3 (𝐴 ≠ ∅ → ((𝐶 × 𝐷) ∩ (𝐶 × 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
1815, 17eqtrid 2778 . 2 (𝐴 ≠ ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
1914, 18pm2.61ine 3011 1 (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wne 2928  Vcvv 3436  cin 3901  c0 4283   ciin 4942   × cxp 5614
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-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pr 5370
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-nf 1785  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 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-iin 4944  df-opab 5154  df-xp 5622  df-rel 5623
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator