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

Theorem ixpin 8481
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 674 . . . 4 ((𝑓 Fn 𝐴 ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
2 elin 4168 . . . . . . 7 ((𝑓𝑥) ∈ (𝐵𝐶) ↔ ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
32ralbii 3165 . . . . . 6 (∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶))
4 r19.26 3170 . . . . . 6 (∀𝑥𝐴 ((𝑓𝑥) ∈ 𝐵 ∧ (𝑓𝑥) ∈ 𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
53, 4bitri 277 . . . . 5 (∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶) ↔ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
65anbi2i 624 . . . 4 ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)) ↔ (𝑓 Fn 𝐴 ∧ (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
7 vex 3497 . . . . . 6 𝑓 ∈ V
87elixp 8462 . . . . 5 (𝑓X𝑥𝐴 𝐵 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵))
97elixp 8462 . . . . 5 (𝑓X𝑥𝐴 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
108, 9anbi12i 628 . . . 4 ((𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶) ↔ ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐵) ∧ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
111, 6, 103bitr4i 305 . . 3 ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)) ↔ (𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶))
127elixp 8462 . . 3 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ (𝐵𝐶)))
13 elin 4168 . . 3 (𝑓 ∈ (X𝑥𝐴 𝐵X𝑥𝐴 𝐶) ↔ (𝑓X𝑥𝐴 𝐵𝑓X𝑥𝐴 𝐶))
1411, 12, 133bitr4i 305 . 2 (𝑓X𝑥𝐴 (𝐵𝐶) ↔ 𝑓 ∈ (X𝑥𝐴 𝐵X𝑥𝐴 𝐶))
1514eqriv 2818 1 X𝑥𝐴 (𝐵𝐶) = (X𝑥𝐴 𝐵X𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wa 398   = wceq 1533  wcel 2110  wral 3138  cin 3934   Fn wfn 6344  cfv 6349  Xcixp 8455
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fn 6352  df-fv 6357  df-ixp 8456
This theorem is referenced by:  ptbasin  22179  ptclsg  22217  ptrest  34885
  Copyright terms: Public domain W3C validator