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

Theorem cbvixpdavw2 37207
Description: Change bound variable and domain in an indexed Cartesian product. Deduction form. (Contributed by GG, 14-Aug-2025.)
Hypotheses
Ref Expression
cbvixpdavw2.1 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐶 = 𝐷)
cbvixpdavw2.2 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵)
Assertion
Ref Expression
cbvixpdavw2 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑦 ∈ 𝐵 𝐷)
Distinct variable groups:   𝜑,𝑥,𝑦   𝑦,𝐴   𝑥,𝐵   𝑦,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)   𝐶(𝑥)   𝐷(𝑦)

Proof of Theorem cbvixpdavw2
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑦) → 𝑥 = 𝑦)
2 cbvixpdavw2.2 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐴 = 𝐵)
31, 2eleq12d 2854 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑦) → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
43cbvabdavw 37169 . . . . 5 (𝜑 → {𝑥 ∣ 𝑥 ∈ 𝐴} = {𝑦 ∣ 𝑦 ∈ 𝐵})
54fneq2d 6638 . . . 4 (𝜑 → (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑡 Fn {𝑦 ∣ 𝑦 ∈ 𝐵}))
6 fveq2 6890 . . . . . . 7 (𝑥 = 𝑦 → (𝑡‘𝑥) = (𝑡‘𝑦))
76adantl 487 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑦) → (𝑡‘𝑥) = (𝑡‘𝑦))
8 cbvixpdavw2.1 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑦) → 𝐶 = 𝐷)
97, 8eleq12d 2854 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑦) → ((𝑡‘𝑥) ∈ 𝐶 ↔ (𝑡‘𝑦) ∈ 𝐷))
109, 2cbvraldva2 3336 . . . 4 (𝜑 → (∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶 ↔ ∀𝑦 ∈ 𝐵 (𝑡‘𝑦) ∈ 𝐷))
115, 10anbi12d 644 . . 3 (𝜑 → ((𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶) ↔ (𝑡 Fn {𝑦 ∣ 𝑦 ∈ 𝐵} ∧ ∀𝑦 ∈ 𝐵 (𝑡‘𝑦) ∈ 𝐷)))
1211abbidv 2826 . 2 (𝜑 → {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)} = {𝑡 ∣ (𝑡 Fn {𝑦 ∣ 𝑦 ∈ 𝐵} ∧ ∀𝑦 ∈ 𝐵 (𝑡‘𝑦) ∈ 𝐷)})
13 df-ixp 8934 . 2 X𝑥 ∈ 𝐴 𝐶 = {𝑡 ∣ (𝑡 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑡‘𝑥) ∈ 𝐶)}
14 df-ixp 8934 . 2 X𝑦 ∈ 𝐵 𝐷 = {𝑡 ∣ (𝑡 Fn {𝑦 ∣ 𝑦 ∈ 𝐵} ∧ ∀𝑦 ∈ 𝐵 (𝑡‘𝑦) ∈ 𝐷)}
1512, 13, 143eqtr4g 2820 1 (𝜑 → X𝑥 ∈ 𝐴 𝐶 = X𝑦 ∈ 𝐵 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076   Fn wfn 6538  ‘cfv 6543  Xcixp 8933
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-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fn 6546  df-fv 6551  df-ixp 8934
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator