Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cbvmpo1 Structured version   Visualization version   GIF version

Theorem cbvmpo1 42686
Description: Rule to change the first bound variable in a maps-to function, using implicit substitution. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
cbvmpo1.1 𝑥𝐵
cbvmpo1.2 𝑧𝐵
cbvmpo1.3 𝑧𝐶
cbvmpo1.4 𝑥𝐸
cbvmpo1.5 (𝑥 = 𝑧𝐶 = 𝐸)
Assertion
Ref Expression
cbvmpo1 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑧𝐴, 𝑦𝐵𝐸)
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥,𝑦,𝑧)   𝐶(𝑥,𝑦,𝑧)   𝐸(𝑥,𝑦,𝑧)

Proof of Theorem cbvmpo1
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 nfv 1915 . . . . 5 𝑧 𝑥𝐴
2 cbvmpo1.2 . . . . . 6 𝑧𝐵
32nfcri 2892 . . . . 5 𝑧 𝑦𝐵
41, 3nfan 1900 . . . 4 𝑧(𝑥𝐴𝑦𝐵)
5 cbvmpo1.3 . . . . 5 𝑧𝐶
65nfeq2 2922 . . . 4 𝑧 𝑢 = 𝐶
74, 6nfan 1900 . . 3 𝑧((𝑥𝐴𝑦𝐵) ∧ 𝑢 = 𝐶)
8 nfv 1915 . . . . 5 𝑥 𝑧𝐴
9 cbvmpo1.1 . . . . . 6 𝑥𝐵
109nfcri 2892 . . . . 5 𝑥 𝑦𝐵
118, 10nfan 1900 . . . 4 𝑥(𝑧𝐴𝑦𝐵)
12 cbvmpo1.4 . . . . 5 𝑥𝐸
1312nfeq2 2922 . . . 4 𝑥 𝑢 = 𝐸
1411, 13nfan 1900 . . 3 𝑥((𝑧𝐴𝑦𝐵) ∧ 𝑢 = 𝐸)
15 eleq1w 2819 . . . . 5 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝐴))
1615anbi1d 631 . . . 4 (𝑥 = 𝑧 → ((𝑥𝐴𝑦𝐵) ↔ (𝑧𝐴𝑦𝐵)))
17 cbvmpo1.5 . . . . 5 (𝑥 = 𝑧𝐶 = 𝐸)
1817eqeq2d 2747 . . . 4 (𝑥 = 𝑧 → (𝑢 = 𝐶𝑢 = 𝐸))
1916, 18anbi12d 632 . . 3 (𝑥 = 𝑧 → (((𝑥𝐴𝑦𝐵) ∧ 𝑢 = 𝐶) ↔ ((𝑧𝐴𝑦𝐵) ∧ 𝑢 = 𝐸)))
207, 14, 19cbvoprab1 7394 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑢 = 𝐶)} = {⟨⟨𝑧, 𝑦⟩, 𝑢⟩ ∣ ((𝑧𝐴𝑦𝐵) ∧ 𝑢 = 𝐸)}
21 df-mpo 7312 . 2 (𝑥𝐴, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑢 = 𝐶)}
22 df-mpo 7312 . 2 (𝑧𝐴, 𝑦𝐵𝐸) = {⟨⟨𝑧, 𝑦⟩, 𝑢⟩ ∣ ((𝑧𝐴𝑦𝐵) ∧ 𝑢 = 𝐸)}
2320, 21, 223eqtr4i 2774 1 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑧𝐴, 𝑦𝐵𝐸)
Colors of variables: wff setvar class
Syntax hints:  wa 397   = wceq 1539  wcel 2104  wnfc 2885  {coprab 7308  cmpo 7309
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-sep 5232  ax-nul 5239  ax-pr 5361
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-rab 3287  df-v 3439  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4566  df-pr 4568  df-op 4572  df-opab 5144  df-oprab 7311  df-mpo 7312
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator