Users' Mathboxes Mathbox for Gino Giotto < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ixpeq12dv Structured version   Visualization version   GIF version

Theorem ixpeq12dv 37005
Description: Equality theorem for infinite Cartesian product. Deduction version. (Contributed by GG, 1-Sep-2025.)
Hypotheses
Ref Expression
ixpeq12dv.1 (𝜑 → 𝐴 = 𝐵)
ixpeq12dv.2 (𝜑 → 𝐶 = 𝐷)
Assertion
Ref Expression
ixpeq12dv (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐷)
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)

Proof of Theorem ixpeq12dv
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 ixpeq12dv.1 . . . . . . . 8 (𝜑 → 𝐴 = 𝐵)
21eleq2d 2846 . . . . . . 7 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
32abbidv 2826 . . . . . 6 (𝜑 → {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝑥 ∈ 𝐵})
43fneq2d 6633 . . . . 5 (𝜑 → (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵}))
52imbi1d 344 . . . . . . 7 (𝜑 → ((𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶)))
65albidv 1952 . . . . . 6 (𝜑 → (∀𝑥(𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶)))
7 df-ral 3077 . . . . . 6 (∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶))
8 df-ral 3077 . . . . . 6 (∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶))
96, 7, 83bitr4g 317 . . . . 5 (𝜑 → (∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶))
104, 9anbi12d 644 . . . 4 (𝜑 → ((𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶) ↔ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)))
1110abbidv 2826 . . 3 (𝜑 → {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)} = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)})
12 df-ixp 8926 . . 3 X𝑥 ∈ 𝐴 𝐶 = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)}
13 df-ixp 8926 . . 3 X𝑥 ∈ 𝐵 𝐶 = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)}
1411, 12, 133eqtr4g 2820 . 2 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐶)
15 ixpeq12dv.2 . . 3 (𝜑 → 𝐶 = 𝐷)
1615ixpeq2dv 8941 . 2 (𝜑 → X𝑥 ∈ 𝐵 𝐶 = X𝑥 ∈ 𝐵 𝐷)
1714, 16eqtrd 2795 1 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076   Fn wfn 6533  ‘cfv 6538  Xcixp 8925
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-ss 3896  df-fn 6541  df-ixp 8926
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator