HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem cbvex4v 1322
Description: Rule used to change bound variables with implicit substitution.
Hypotheses
Ref Expression
cbvex4v.1 |- ((x = v /\ y = u) -> (ph <-> ps))
cbvex4v.2 |- ((z = f /\ w = g) -> (ps <-> ch))
Assertion
Ref Expression
cbvex4v |- (E.xE.yE.zE.wph <-> E.vE.uE.fE.gch)
Distinct variable groups:   z,w,ch   v,u,ph   x,y,ps   f,g,ps   w,f   z,g   w,u,x,y,z,v

Proof of Theorem cbvex4v
StepHypRef Expression
1 cbvex4v.1 . . . 4 |- ((x = v /\ y = u) -> (ph <-> ps))
212exbidv 1281 . . 3 |- ((x = v /\ y = u) -> (E.zE.wph <-> E.zE.wps))
32cbvex2v 1319 . 2 |- (E.xE.yE.zE.wph <-> E.vE.uE.zE.wps)
4 cbvex4v.2 . . . 4 |- ((z = f /\ w = g) -> (ps <-> ch))
54cbvex2v 1319 . . 3 |- (E.zE.wps <-> E.fE.gch)
652exbii 1052 . 2 |- (E.vE.uE.zE.wps <-> E.vE.uE.fE.gch)
73, 6bitr 173 1 |- (E.xE.yE.zE.wph <-> E.vE.uE.fE.gch)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956  E.wex 980
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981
Copyright terms: Public domain