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

Theorem cbvralv2 3710
 Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution which also changes the quantifier domain. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
cbvralv2.1 (𝑥 = 𝑦 → (𝜓𝜒))
cbvralv2.2 (𝑥 = 𝑦𝐴 = 𝐵)
Assertion
Ref Expression
cbvralv2 (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐵 𝜒)
Distinct variable groups:   𝑦,𝐴   𝜓,𝑦   𝑥,𝐵   𝜒,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem cbvralv2
StepHypRef Expression
1 nfcv 2902 . 2 𝑦𝐴
2 nfcv 2902 . 2 𝑥𝐵
3 nfv 1992 . 2 𝑦𝜓
4 nfv 1992 . 2 𝑥𝜒
5 cbvralv2.2 . 2 (𝑥 = 𝑦𝐴 = 𝐵)
6 cbvralv2.1 . 2 (𝑥 = 𝑦 → (𝜓𝜒))
71, 2, 3, 4, 5, 6cbvralcsf 3706 1 (∀𝑥𝐴 𝜓 ↔ ∀𝑦𝐵 𝜒)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   = wceq 1632  ∀wral 3050 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-sbc 3577  df-csb 3675 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator