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

Theorem ixpiin 8928
Description: The indexed intersection of a collection of infinite Cartesian products. (Contributed by Mario Carneiro, 6-Feb-2015.)
Assertion
Ref Expression
ixpiin (𝐵 ≠ ∅ → X𝑥𝐴 𝑦𝐵 𝐶 = 𝑦𝐵 X𝑥𝐴 𝐶)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦
Allowed substitution hints:   𝐶(𝑥, 𝑦)

Proof of Theorem ixpiin
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 r19.28zv 4469 . . . 4 (𝐵 ≠ ∅ → (∀𝑦𝐵 (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑦𝐵𝑥𝐴 (𝑓𝑥) ∈ 𝐶)))
2 eliin 4963 . . . . . 6 (𝑓 ∈ V → (𝑓 𝑦𝐵 X𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑓X𝑥𝐴 𝐶))
32elv 3462 . . . . 5 (𝑓 𝑦𝐵 X𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑓X𝑥𝐴 𝐶)
4 vex 3461 . . . . . . 7 𝑓 ∈ V
54elixp 8908 . . . . . 6 (𝑓X𝑥𝐴 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
65ralbii 3113 . . . . 5 (∀𝑦𝐵 𝑓X𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
73, 6bitri 278 . . . 4 (𝑓 𝑦𝐵 X𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
84elixp 8908 . . . . 5 (𝑓X𝑥𝐴 𝑦𝐵 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝑦𝐵 𝐶))
9 fvex 6898 . . . . . . . . 9 (𝑓𝑥) ∈ V
10 eliin 4963 . . . . . . . . 9 ((𝑓𝑥) ∈ V → ((𝑓𝑥) ∈ 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 (𝑓𝑥) ∈ 𝐶))
119, 10ax-mp 5 . . . . . . . 8 ((𝑓𝑥) ∈ 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 (𝑓𝑥) ∈ 𝐶)
1211ralbii 3113 . . . . . . 7 (∀𝑥𝐴 (𝑓𝑥) ∈ 𝑦𝐵 𝐶 ↔ ∀𝑥𝐴𝑦𝐵 (𝑓𝑥) ∈ 𝐶)
13 ralcom 3295 . . . . . . 7 (∀𝑥𝐴𝑦𝐵 (𝑓𝑥) ∈ 𝐶 ↔ ∀𝑦𝐵𝑥𝐴 (𝑓𝑥) ∈ 𝐶)
1412, 13bitri 278 . . . . . 6 (∀𝑥𝐴 (𝑓𝑥) ∈ 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵𝑥𝐴 (𝑓𝑥) ∈ 𝐶)
1514anbi2i 635 . . . . 5 ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝑦𝐵 𝐶) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑦𝐵𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
168, 15bitri 278 . . . 4 (𝑓X𝑥𝐴 𝑦𝐵 𝐶 ↔ (𝑓 Fn 𝐴 ∧ ∀𝑦𝐵𝑥𝐴 (𝑓𝑥) ∈ 𝐶))
171, 7, 163bitr4g 317 . . 3 (𝐵 ≠ ∅ → (𝑓 𝑦𝐵 X𝑥𝐴 𝐶𝑓X𝑥𝐴 𝑦𝐵 𝐶))
1817eqrdv 2763 . 2 (𝐵 ≠ ∅ → 𝑦𝐵 X𝑥𝐴 𝐶 = X𝑥𝐴 𝑦𝐵 𝐶)
1918eqcomd 2771 1 (𝐵 ≠ ∅ → X𝑥𝐴 𝑦𝐵 𝐶 = 𝑦𝐵 X𝑥𝐴 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wne 2960  wral 3081  Vcvv 3457  c0 4286   ciin 4959   Fn wfn 6535  cfv 6540  Xcixp 8901
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-12 2216  ax-ext 2737  ax-nul 5271
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iin 4961  df-br 5112  df-opab 5176  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548  df-ixp 8902
This theorem is used by:  ixpint  8929  ptbasfi  23789  iccvonmbllem  47450
  Copyright terms: Public domain W3C validator