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

Theorem xpriindi 5813
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 4969 . . . . . . 7 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ ∅ 𝐵)
2 0iin 5022 . . . . . . 7 ∩ 𝑥 ∈ ∅ 𝐵 = V
31, 2eqtrdi 2812 . . . . . 6 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 𝐵 = V)
43ineq2d 4166 . . . . 5 (𝐴 = ∅ → (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = (𝐷 ∩ V))
5 inv1 4348 . . . . 5 (𝐷 ∩ V) = 𝐷
64, 5eqtrdi 2812 . . . 4 (𝐴 = ∅ → (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵) = 𝐷)
76xpeq2d 5681 . . 3 (𝐴 = ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = (𝐶 × 𝐷))
8 iineq1 4969 . . . . . 6 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵) = ∩ 𝑥 ∈ ∅ (𝐶 × 𝐵))
9 0iin 5022 . . . . . 6 ∩ 𝑥 ∈ ∅ (𝐶 × 𝐵) = V
108, 9eqtrdi 2812 . . . . 5 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵) = V)
1110ineq2d 4166 . . . 4 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)) = ((𝐶 × 𝐷) ∩ V))
12 inv1 4348 . . . 4 ((𝐶 × 𝐷) ∩ V) = (𝐶 × 𝐷)
1311, 12eqtrdi 2812 . . 3 (𝐴 = ∅ → ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)) = (𝐶 × 𝐷))
147, 13eqtr4d 2799 . 2 (𝐴 = ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
15 xpindi 5810 . . 3 (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵))
16 xpiindi 5812 . . . 4 (𝐴 ≠ ∅ → (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵) = ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵))
1716ineq2d 4166 . . 3 (𝐴 ≠ ∅ → ((𝐶 × 𝐷) ∩ (𝐶 × ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
1815, 17eqtrid 2808 . 2 (𝐴 ≠ ∅ → (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵)))
1914, 18pm2.61ine 3039 1 (𝐶 × (𝐷 ∩ ∩ 𝑥 ∈ 𝐴 𝐵)) = ((𝐶 × 𝐷) ∩ ∩ 𝑥 ∈ 𝐴 (𝐶 × 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ≠ wne 2956  Vcvv 3451   ∩ cin 3898  ∅c0 4279  ∩ ciin 4952   × cxp 5649
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-iin 4954  df-opab 5168  df-xp 5657  df-rel 5658
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator