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

Theorem ixpin 8475
Description: The intersection of two infinite Cartesian products. (Contributed by Mario Carneiro, 3-Feb-2015.)
Assertion
Ref Expression
ixpin X𝑥𝐴 (𝐵𝐶) = (X𝑥𝐴 𝐵X𝑥𝐴 𝐶)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem ixpin
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 anandi 672 . . . 4 ((𝑓 Fn 𝐴 ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
2 elin 4166 . . . . . . 7 ((𝑓𝑥) ∈ (𝐵𝐶) ↔ ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
32ralbii 3162 . . . . . 6 (∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
4 r19.26 3167 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
53, 4bitri 276 . . . . 5 (∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
65anbi2i 622 . . . 4 ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)) ↔ (𝑓 Fn 𝐴 ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
7 vex 3495 . . . . . 6 𝑓 ∈ V
87elixp 8456 . . . . 5 (𝑓X𝑥𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵))
97elixp 8456 . . . . 5 (𝑓X𝑥𝐴 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
108, 9anbi12i 626 . . . 4 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
111, 6, 103bitr4i 304 . . 3 ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)) ↔ (𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶))
127elixp 8456 . . 3 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
13 elin 4166 . . 3 (𝑓 ∈ (X𝑥𝐴 𝐵X𝑥𝐴 𝐶) ↔ (𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶))
1411, 12, 133bitr4i 304 . 2 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ 𝑓 ∈ (X𝑥𝐴 𝐵X𝑥𝐴 𝐶))
1514eqriv 2815 1 X𝑥𝐴 (𝐵𝐶) = (X𝑥𝐴 𝐵X𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1528  wcel 2105  wral 3135  cin 3932   Fn wfn 6343  cfv 6348  Xcixp 8449
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fn 6351  df-fv 6356  df-ixp 8450
This theorem is referenced by:  ptbasin  22113  ptclsg  22151  ptrest  34772
  Copyright terms: Public domain W3C validator