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

Theorem sb6f 1570
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 1537 . . 3 |- ([y / x]ph -> [y / x]A.yph)
3 sb4a 1568 . . 3 |- ([y / x]A.yph -> A.x(x = y -> ph))
42, 3syl 12 . 2 |- ([y / x]ph -> A.x(x = y -> ph))
5 sb2 1541 . 2 |- (A.x(x = y -> ph) -> [y / x]ph)
64, 5impbii 174 1 |- ([y / x]ph <-> A.x(x = y -> ph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163  A.wal 1296   = wceq 1298  [wsbc 1534
This theorem is referenced by:  sb5f 1571
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1305  ax-11 1309  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327  df-sb 1536
Copyright terms: Public domain