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

Theorem sbal2 1005
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 group(s):   y,z   x,z

Proof of Theorem sbal2
StepHypRef Expression
1 eq6 826 . . . 4 |- (-. A.x x = y -> A.y -. A.x x = y)
2 ddeeq1 1001 . . . . . . 7 |- (-. A.x x = y -> (y = z -> A.x y = z))
3219.20i 691 . . . . . 6 |- (A.x -. A.x x = y -> A.x(y = z -> A.x y = z))
43eq6s 827 . . . . 5 |- (-. A.x x = y -> A.x(y = z -> A.x y = z))
5 19.21g 792 . . . . 5 |- (A.x(y = z -> A.x y = z) -> (A.x(y = z -> ph) <-> (y = z -> A.xph)))
64, 5syl 12 . . . 4 |- (-. A.x x = y -> (A.x(y = z -> ph) <-> (y = z -> A.xph)))
71, 6biald 782 . . 3 |- (-. A.x x = y -> (A.yA.x(y = z -> ph) <-> A.y(y = z -> A.xph)))
8 alcom 715 . . 3 |- (A.yA.x(y = z -> ph) <-> A.xA.y(y = z -> ph))
97, 8syl5rbbr 413 . 2 |- (-. A.x x = y -> (A.y(y = z -> A.xph) <-> A.xA.y(y = z -> ph)))
10 sb6 989 . 2 |- ([z / y]A.xph <-> A.y(y = z -> A.xph))
11 sb6 989 . . 3 |- ([z / y]ph <-> A.y(y = z -> ph))
1211bial 695 . 2 |- (A.x[z / y]ph <-> A.xA.y(y = z -> ph))
139, 10, 123bitr4g 428 1 |- (-. A.x x = y -> ([z / y]A.xph <-> A.x[z / y]ph))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127  A.wal 672   = weq 797  [wsb 852
This theorem is referenced by:  axrepndlem2 3739
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853
metamath.org