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

Theorem ixpeq1 7863
Description: Equality theorem for infinite Cartesian product. (Contributed by NM, 29-Sep-2006.)
Assertion
Ref Expression
ixpeq1 (𝐴 = 𝐵X𝑥𝐴 𝐶 = X𝑥𝐵 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem ixpeq1
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 fneq2 5938 . . . 4 (𝐴 = 𝐵 → (𝑓 Fn 𝐴𝑓 Fn 𝐵))
2 raleq 3127 . . . 4 (𝐴 = 𝐵 → (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶 ↔ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶))
31, 2anbi12d 746 . . 3 (𝐴 = 𝐵 → ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶) ↔ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)))
43abbidv 2738 . 2 (𝐴 = 𝐵 → {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)} = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)})
5 dfixp 7854 . 2 X𝑥𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)}
6 dfixp 7854 . 2 X𝑥𝐵 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)}
74, 5, 63eqtr4g 2680 1 (𝐴 = 𝐵X𝑥𝐴 𝐶 = X𝑥𝐵 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wcel 1987  {cab 2607  wral 2907   Fn wfn 5842  cfv 5847  Xcixp 7852
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-fn 5850  df-ixp 7853
This theorem is referenced by:  ixpeq1d  7864  finixpnum  33023  ioorrnopn  39829  ioorrnopnxr  39831  ovnval  40059  hoicvr  40066  hoidmv1le  40112  hoidmvle  40118  ovnhoi  40121  hspval  40127  ovnlecvr2  40128  hoiqssbl  40143  vonhoire  40190  iunhoiioo  40194  vonioo  40200  vonicc  40203
  Copyright terms: Public domain W3C validator