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

Theorem ixpeq1 8087
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 6141 . . . 4 (𝐴 = 𝐵 → (𝑓 Fn 𝐴𝑓 Fn 𝐵))
2 raleq 3277 . . . 4 (𝐴 = 𝐵 → (∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶 ↔ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶))
31, 2anbi12d 749 . . 3 (𝐴 = 𝐵 → ((𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶) ↔ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)))
43abbidv 2879 . 2 (𝐴 = 𝐵 → {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)} = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)})
5 dfixp 8078 . 2 X𝑥𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑓𝑥) ∈ 𝐶)}
6 dfixp 8078 . 2 X𝑥𝐵 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥𝐵 (𝑓𝑥) ∈ 𝐶)}
74, 5, 63eqtr4g 2819 1 (𝐴 = 𝐵X𝑥𝐴 𝐶 = X𝑥𝐵 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1632  wcel 2139  {cab 2746  wral 3050   Fn wfn 6044  cfv 6049  Xcixp 8076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-fn 6052  df-ixp 8077
This theorem is referenced by:  ixpeq1d  8088  finixpnum  33725  ioorrnopn  41046  ioorrnopnxr  41048  ovnval  41279  hoicvr  41286  hoidmv1le  41332  hoidmvle  41338  ovnhoi  41341  hspval  41347  ovnlecvr2  41348  hoiqssbl  41363  vonhoire  41410  iunhoiioo  41414  vonioo  41420  vonicc  41423
  Copyright terms: Public domain W3C validator