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 37182
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 2850 . . . . . . 7 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))
32abbidv 2829 . . . . . 6 (𝜑 → {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑥 ∣ 𝑥 ∈ 𝐵})
43fneq2d 6652 . . . . 5 (𝜑 → (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵}))
52imbi1d 344 . . . . . . 7 (𝜑 → ((𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶)))
65albidv 1955 . . . . . 6 (𝜑 → (∀𝑥(𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶)))
7 df-ral 3081 . . . . . 6 (∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑡‘𝑥) ∈ 𝐶))
8 df-ral 3081 . . . . . 6 (∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝑡‘𝑥) ∈ 𝐶))
96, 7, 83bitr4g 317 . . . . 5 (𝜑 → (∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶))
104, 9anbi12d 644 . . . 4 (𝜑 → ((𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶) ↔ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)))
1110abbidv 2829 . . 3 (𝜑 → {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)} = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)})
12 df-ixp 8951 . . 3 X𝑥 ∈ 𝐴 𝐶 = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)}
13 df-ixp 8951 . . 3 X𝑥 ∈ 𝐵 𝐶 = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐵} ∧ ∀𝑥 ∈ 𝐵 (𝑡‘𝑥) ∈ 𝐶)}
1411, 12, 133eqtr4g 2823 . 2 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐶)
15 ixpeq12dv.2 . . 3 (𝜑 → 𝐶 = 𝐷)
1615ixpeq2dv 8966 . 2 (𝜑 → X𝑥 ∈ 𝐵 𝐶 = X𝑥 ∈ 𝐵 𝐷)
1714, 16eqtrd 2798 1 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080   Fn wfn 6550  ‘cfv 6555  Xcixp 8950
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-ss 3901  df-fn 6558  df-ixp 8951
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator