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

Theorem xpriindi 5791
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 4951 . . . . . . 7 (𝐴 = ∅ → 𝑥𝐴 𝐵 = 𝑥 ∈ ∅ 𝐵)
2 0iin 5006 . . . . . . 7 𝑥 ∈ ∅ 𝐵 = V
31, 2eqtrdi 2787 . . . . . 6 (𝐴 = ∅ → 𝑥𝐴 𝐵 = V)
43ineq2d 4160 . . . . 5 (𝐴 = ∅ → (𝐷 𝑥𝐴 𝐵) = (𝐷 ∩ V))
5 inv1 4338 . . . . 5 (𝐷 ∩ V) = 𝐷
64, 5eqtrdi 2787 . . . 4 (𝐴 = ∅ → (𝐷 𝑥𝐴 𝐵) = 𝐷)
76xpeq2d 5661 . . 3 (𝐴 = ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = (𝐶 × 𝐷))
8 iineq1 4951 . . . . . 6 (𝐴 = ∅ → 𝑥𝐴 (𝐶 × 𝐵) = 𝑥 ∈ ∅ (𝐶 × 𝐵))
9 0iin 5006 . . . . . 6 𝑥 ∈ ∅ (𝐶 × 𝐵) = V
108, 9eqtrdi 2787 . . . . 5 (𝐴 = ∅ → 𝑥𝐴 (𝐶 × 𝐵) = V)
1110ineq2d 4160 . . . 4 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)) = ((𝐶 × 𝐷) ∩ V))
12 inv1 4338 . . . 4 ((𝐶 × 𝐷) ∩ V) = (𝐶 × 𝐷)
1311, 12eqtrdi 2787 . . 3 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)) = (𝐶 × 𝐷))
147, 13eqtr4d 2774 . 2 (𝐴 = ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
15 xpindi 5788 . . 3 (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ (𝐶 × 𝑥𝐴 𝐵))
16 xpiindi 5790 . . . 4 (𝐴 ≠ ∅ → (𝐶 × 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶 × 𝐵))
1716ineq2d 4160 . . 3 (𝐴 ≠ ∅ → ((𝐶 × 𝐷) ∩ (𝐶 × 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
1815, 17eqtrid 2783 . 2 (𝐴 ≠ ∅ → (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵)))
1914, 18pm2.61ine 3015 1 (𝐶 × (𝐷 𝑥𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ 𝑥𝐴 (𝐶 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  wne 2932  Vcvv 3429  cin 3888  c0 4273   ciin 4934   × cxp 5629
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-iin 4936  df-opab 5148  df-xp 5637  df-rel 5638
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator