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

Theorem sbal2 1358
Description: Move quantifier in and out of substitution.
Assertion
Ref Expression
sbal2 |- (-. A.x x = y -> ([z / y]A.xph <-> A.x[z / y]ph))
Distinct variable groups:   y,z   x,z

Proof of Theorem sbal2
StepHypRef Expression
1 hbnae 1147 . . . 4 |- (-. A.x x = y -> A.y -. A.x x = y)
2 dveeq1 1354 . . . . . . 7 |- (-. A.x x = y -> (y = z -> A.x y = z))
3219.20i 992 . . . . . 6 |- (A.x -. A.x x = y -> A.x(y = z -> A.x y = z))
43hbnaes 1148 . . . . 5 |- (-. A.x x = y -> A.x(y = z -> A.x y = z))
5 19.21t 1115 . . . . 5 |- (A.x(y = z -> A.x y = z) -> (A.x(y = z -> ph) <-> (y = z -> A.xph)))
64, 5syl 10 . . . 4 |- (-. A.x x = y -> (A.x(y = z -> ph) <-> (y = z -> A.xph)))
71, 6albid 1104 . . 3 |- (-. A.x x = y -> (A.yA.x(y = z -> ph) <-> A.y(y = z -> A.xph)))
8 alcom 1032 . . 3 |- (A.yA.x(y = z -> ph) <-> A.xA.y(y = z -> ph))
97, 8syl5rbbr 535 . 2 |- (-. A.x x = y -> (A.y(y = z -> A.xph) <-> A.xA.y(y = z -> ph)))
10 sb6 1267 . 2 |- ([z / y]A.xph <-> A.y(y = z -> A.xph))
11 sb6 1267 . . 3 |- ([z / y]ph <-> A.y(y = z -> ph))
1211albii 999 . 2 |- (A.x[z / y]ph <-> A.xA.y(y = z -> ph))
139, 10, 123bitr4g 555 1 |- (-. A.x x = y -> ([z / y]A.xph <-> A.x[z / y]ph))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146  A.wal 954   = wceq 956  [wsbc 1170
This theorem is referenced by:  axrepndlem2 4945
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-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172
Copyright terms: Public domain