MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbval2vw Structured version   Visualization version   GIF version

Theorem cbval2vw 2037
Description: Rule used to change bound variables, using implicit substitution. Version of cbval2vv 2416 with more disjoint variable conditions, which requires fewer axioms . (Contributed by NM, 4-Feb-2005.) Avoid ax-13 2375. (Revised by GG, 10-Jan-2024.)
Hypothesis
Ref Expression
cbval2vw.1 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
Assertion
Ref Expression
cbval2vw (∀𝑥𝑦𝜑 ↔ ∀𝑧𝑤𝜓)
Distinct variable groups:   𝑧,𝑤,𝜑   𝑥,𝑦,𝜓   𝑥,𝑤,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑧,𝑤)

Proof of Theorem cbval2vw
StepHypRef Expression
1 cbval2vw.1 . . 3 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
21cbvaldvaw 2035 . 2 (𝑥 = 𝑧 → (∀𝑦𝜑 ↔ ∀𝑤𝜓))
32cbvalvw 2033 1 (∀𝑥𝑦𝜑 ↔ ∀𝑧𝑤𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005
This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1777
This theorem is referenced by:  seqf1o  14081  fi1uzind  14543  brfi1indALT  14546  mbfresfi  37653
  Copyright terms: Public domain W3C validator