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

Theorem cbval2v 2364
 Description: Rule used to change bound variables, using implicit substitution. Version of cbval2 2433 with a disjoint variable condition, which does not require ax-13 2391. (Contributed by NM, 22-Dec-2003.) (Revised by BJ, 16-Jun-2019.) (Proof shortened by Gino Giotto, 10-Jan-2024.)
Hypotheses
Ref Expression
cbval2v.1 𝑧𝜑
cbval2v.2 𝑤𝜑
cbval2v.3 𝑥𝜓
cbval2v.4 𝑦𝜓
cbval2v.5 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
Assertion
Ref Expression
cbval2v (∀𝑥𝑦𝜑 ↔ ∀𝑧𝑤𝜓)
Distinct variable group:   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝜓(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cbval2v
StepHypRef Expression
1 cbval2v.1 . . 3 𝑧𝜑
21nfal 2343 . 2 𝑧𝑦𝜑
3 cbval2v.3 . . 3 𝑥𝜓
43nfal 2343 . 2 𝑥𝑤𝜓
5 nfv 1915 . . 3 𝑦 𝑥 = 𝑧
6 nfv 1915 . . 3 𝑤 𝑥 = 𝑧
7 cbval2v.2 . . . 4 𝑤𝜑
87a1i 11 . . 3 (𝑥 = 𝑧 → Ⅎ𝑤𝜑)
9 cbval2v.4 . . . 4 𝑦𝜓
109a1i 11 . . 3 (𝑥 = 𝑧 → Ⅎ𝑦𝜓)
11 cbval2v.5 . . . 4 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
1211ex 416 . . 3 (𝑥 = 𝑧 → (𝑦 = 𝑤 → (𝜑𝜓)))
135, 6, 8, 10, 12cbv2w 2358 . 2 (𝑥 = 𝑧 → (∀𝑦𝜑 ↔ ∀𝑤𝜓))
142, 4, 13cbvalv1 2362 1 (∀𝑥𝑦𝜑 ↔ ∀𝑧𝑤𝜓)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536  Ⅎwnf 1785 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2145  ax-11 2161  ax-12 2178 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786 This theorem is referenced by:  cbvex2v  2366  bj-cbval2vv  34199  eqrelf  35635
 Copyright terms: Public domain W3C validator