Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvrmov Structured version   GIF version

Theorem cbvrmov 2530
 Description: Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Hypothesis
Ref Expression
cbvralv.1 (x = y → (φψ))
Assertion
Ref Expression
cbvrmov (∃*x A φ∃*y A ψ)
Distinct variable groups:   x,A   y,A   φ,y   ψ,x
Allowed substitution hints:   φ(x)   ψ(y)

Proof of Theorem cbvrmov
StepHypRef Expression
1 nfv 1418 . 2 yφ
2 nfv 1418 . 2 xψ
3 cbvralv.1 . 2 (x = y → (φψ))
41, 2, 3cbvrmo 2526 1 (∃*x A φ∃*y A ψ)
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 98  ∃*wrmo 2303 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019 This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-eu 1900  df-mo 1901  df-cleq 2030  df-clel 2033  df-nfc 2164  df-rex 2306  df-reu 2307  df-rmo 2308 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator