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

Theorem ixpeq1 8929
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 6629 . . . 4 (𝐴 = 𝐵 → (𝑓 Fn 𝐴 ↔ 𝑓 Fn 𝐵))
2 raleq 3317 . . . 4 (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶))
31, 2anbi12d 644 . . 3 (𝐴 = 𝐵 → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶) ↔ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)))
43abbidv 2827 . 2 (𝐴 = 𝐵 → {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)} = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)})
5 dfixp 8920 . 2 X𝑥 ∈ 𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)}
6 dfixp 8920 . 2 X𝑥 ∈ 𝐵 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)}
74, 5, 63eqtr4g 2821 1 (𝐴 = 𝐵 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077   Fn wfn 6532  ‘cfv 6537  Xcixp 8918
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 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-fn 6540  df-ixp 8919
This theorem is used by:  ixpeq1d  8930  finixpnum  38508  ioorrnopn  47284  ioorrnopnxr  47286  ovnval  47520  hoicvr  47527  hoidmv1le  47573  hoidmvle  47579  ovnhoi  47582  hspval  47588  ovnlecvr2  47589  hoiqssbl  47604  vonhoire  47651  iunhoiioo  47655  vonioo  47661  vonicc  47664
  Copyright terms: Public domain W3C validator