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

Theorem sb6f 1205
Description: Equivalence for substitution when y is not free in ph.
Hypothesis
Ref Expression
equs45f.1 |- (ph -> A.yph)
Assertion
Ref Expression
sb6f |- ([y / x]ph <-> A.x(x = y -> ph))

Proof of Theorem sb6f
StepHypRef Expression
1 equs45f.1 . . . 4 |- (ph -> A.yph)
21sbimi 1177 . . 3 |- ([y / x]ph -> [y / x]A.yph)
3 sb4a 1203 . . 3 |- ([y / x]A.yph -> A.x(x = y -> ph))
42, 3syl 10 . 2 |- ([y / x]ph -> A.x(x = y -> ph))
5 sb2 1181 . 2 |- (A.x(x = y -> ph) -> [y / x]ph)
64, 5impbii 157 1 |- ([y / x]ph <-> A.x(x = y -> ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 958   = wceq 960  [wsbc 1174
This theorem is referenced by:  sb5f 1206
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 967  ax-11 971  ax-4 977  ax-5o 979  ax-6o 982  ax-9o 1127
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 985  df-sb 1176
Copyright terms: Public domain