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

Theorem cbvmpovw2 37031
Description: Change bound variables and domains in a maps-to function, using implicit substitution. (Contributed by GG, 14-Aug-2025.)
Hypotheses
Ref Expression
cbvmpovw2.1 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐸 = 𝐹)
cbvmpovw2.2 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐶 = 𝐷)
cbvmpovw2.3 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐴 = 𝐵)
Assertion
Ref Expression
cbvmpovw2 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ 𝐸) = (𝑧 ∈ 𝐵, 𝑤 ∈ 𝐷 ↦ 𝐹)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤   𝑧,𝐴,𝑤   𝑥,𝐵,𝑦   𝑧,𝐶,𝑤   𝑥,𝐷,𝑦   𝑧,𝐸,𝑤   𝑥,𝐹,𝑦
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑧, 𝑤)   𝐶(𝑥, 𝑦)   𝐷(𝑧, 𝑤)   𝐸(𝑥, 𝑦)   𝐹(𝑧, 𝑤)

Proof of Theorem cbvmpovw2
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . . . 6 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝑥 = 𝑧)
2 cbvmpovw2.3 . . . . . 6 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐴 = 𝐵)
31, 2eleq12d 2855 . . . . 5 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵))
4 simpr 490 . . . . . 6 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝑦 = 𝑤)
5 cbvmpovw2.2 . . . . . 6 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐶 = 𝐷)
64, 5eleq12d 2855 . . . . 5 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑦 ∈ 𝐶 ↔ 𝑤 ∈ 𝐷))
73, 6anbi12d 644 . . . 4 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ↔ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷)))
8 cbvmpovw2.1 . . . . 5 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐸 = 𝐹)
98eqeq2d 2772 . . . 4 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑡 = 𝐸 ↔ 𝑡 = 𝐹))
107, 9anbi12d 644 . . 3 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∧ 𝑡 = 𝐸) ↔ ((𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) ∧ 𝑡 = 𝐹)))
1110cbvoprab12v 7510 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑡⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∧ 𝑡 = 𝐸)} = {⟨⟨𝑧, 𝑤⟩, 𝑡⟩ ∣ ((𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) ∧ 𝑡 = 𝐹)}
12 df-mpo 7425 . 2 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ 𝐸) = {⟨⟨𝑥, 𝑦⟩, 𝑡⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐶) ∧ 𝑡 = 𝐸)}
13 df-mpo 7425 . 2 (𝑧 ∈ 𝐵, 𝑤 ∈ 𝐷 ↦ 𝐹) = {⟨⟨𝑧, 𝑤⟩, 𝑡⟩ ∣ ((𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐷) ∧ 𝑡 = 𝐹)}
1411, 12, 133eqtr4i 2794 1 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐶 ↦ 𝐸) = (𝑧 ∈ 𝐵, 𝑤 ∈ 𝐷 ↦ 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {coprab 7421   ∈ cmpo 7422
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-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-oprab 7424  df-mpo 7425
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator