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

Theorem ixpint 8983
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 8969 . . 3 (∀𝑥𝐴 𝐵 = 𝑦𝐵 𝑦X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦)
2 intiin 5082 . . . 4 𝐵 = 𝑦𝐵 𝑦
32a1i 11 . . 3 (𝑥𝐴 𝐵 = 𝑦𝐵 𝑦)
41, 3mprg 3073 . 2 X𝑥𝐴 𝐵 = X𝑥𝐴 𝑦𝐵 𝑦
5 ixpiin 8982 . 2 (𝐵 ≠ ∅ → X𝑥𝐴 𝑦𝐵 𝑦 = 𝑦𝐵 X𝑥𝐴 𝑦)
64, 5eqtrid 2792 1 (𝐵 ≠ ∅ → X𝑥𝐴 𝐵 = 𝑦𝐵 X𝑥𝐴 𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2108  wne 2946  c0 4352   cint 4970   ciin 5016  Xcixp 8955
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2158  ax-12 2178  ax-ext 2711  ax-nul 5324
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iin 5018  df-br 5167  df-opab 5229  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fn 6576  df-fv 6581  df-ixp 8956
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator