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

Theorem ixpint 8671
Description: The intersection of a collection of infinite Cartesian products. (Contributed by Mario Carneiro, 3-Feb-2015.)
Assertion
Ref Expression
ixpint (𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = 𝑦𝐵 X𝑥𝐴 𝑦)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem ixpint
StepHypRef Expression
1 ixpeq2 8657 . . 3 (∀𝑥𝐴 𝐵 = 𝑦𝐵 𝑦X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦)
2 intiin 4985 . . . 4 𝐵 = 𝑦𝐵 𝑦
32a1i 11 . . 3 (𝑥𝐴 𝐵 = 𝑦𝐵 𝑦)
41, 3mprg 3077 . 2 X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦
5 ixpiin 8670 . 2 (𝐵 ≠ ∅ → X𝑥𝐴 𝑦𝐵 𝑦 = 𝑦𝐵 X𝑥𝐴 𝑦)
64, 5eqtrid 2790 1 (𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = 𝑦𝐵 X𝑥𝐴 𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2108  wne 2942  c0 4253   cint 4876   ciin 4922  Xcixp 8643
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-nul 5225
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-iin 4924  df-br 5071  df-opab 5133  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-ixp 8644
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator