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

Theorem ixpint 8918
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 8904 . . 3 (∀𝑥𝐴 𝐵 = 𝑦𝐵 𝑦X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦)
2 intiin 5062 . . . 4 𝐵 = 𝑦𝐵 𝑦
32a1i 11 . . 3 (𝑥𝐴 𝐵 = 𝑦𝐵 𝑦)
41, 3mprg 3067 . 2 X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦
5 ixpiin 8917 . 2 (𝐵 ≠ ∅ → X𝑥𝐴 𝑦𝐵 𝑦 = 𝑦𝐵 X𝑥𝐴 𝑦)
64, 5eqtrid 2784 1 (𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = 𝑦𝐵 X𝑥𝐴 𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  wne 2940  c0 4322   cint 4950   ciin 4998  Xcixp 8890
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-11 2154  ax-12 2171  ax-ext 2703  ax-nul 5306
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iin 5000  df-br 5149  df-opab 5211  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-iota 6495  df-fun 6545  df-fn 6546  df-fv 6551  df-ixp 8891
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator