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

Theorem xpriindi 5812
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 4968 . . . . . . 7 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ ∅ 𝐵)
2 0iin 5021 . . . . . . 7 ∩ 𝑥 ∈ ∅ 𝐵 = V
31, 2eqtrdi 2811 . . . . . 6 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = V)
43ineq2d 4117 . . . . 5 (𝐴 = ∅ → (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = (𝐷 ∩ V))
5 inv1 4347 . . . . 5 (𝐷 ∩ V) = 𝐷
64, 5eqtrdi 2811 . . . 4 (𝐴 = ∅ → (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = 𝐷)
76xpeq2d 5680 . . 3 (𝐴 = ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = (𝐶 × 𝐷))
8 iineq1 4968 . . . . . 6 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵) = ∩ 𝑥 ∈ ∅ (𝐶 × 𝐵))
9 0iin 5021 . . . . . 6 ∩ 𝑥 ∈ ∅ (𝐶 × 𝐵) = V
108, 9eqtrdi 2811 . . . . 5 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵) = V)
1110ineq2d 4117 . . . 4 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)) = ((𝐶 × 𝐷) ∩ V))
12 inv1 4347 . . . 4 ((𝐶 × 𝐷) ∩ V) = (𝐶 × 𝐷)
1311, 12eqtrdi 2811 . . 3 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)) = (𝐶 × 𝐷))
147, 13eqtr4d 2798 . 2 (𝐴 = ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
15 xpindi 5809 . . 3 (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵))
16 xpiindi 5811 . . . 4 (𝐴 ≠ ∅ → (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵))
1716ineq2d 4117 . . 3 (𝐴 ≠ ∅ → ((𝐶 × 𝐷) ∩ (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
1815, 17eqtrid 2807 . 2 (𝐴 ≠ ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
1914, 18pm2.61ine 3038 1 (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ≠ wne 2955  Vcvv 3450   ∩ cin 4089  ∅c0 4278  ∩ ciin 4951   × cxp 5648
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-iin 4953  df-opab 5167  df-xp 5656  df-rel 5657
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator