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

Theorem sblbis 1235
Description: Introduce left biconditional inside of a substitution.
Hypothesis
Ref Expression
sblbis.1 |- ([y / x]ph <-> ps)
Assertion
Ref Expression
sblbis |- ([y / x](ch <-> ph) <-> ([y / x]ch <-> ps))

Proof of Theorem sblbis
StepHypRef Expression
1 sbbi 1234 . 2 |- ([y / x](ch <-> ph) <-> ([y / x]ch <-> [y / x]ph))
2 sblbis.1 . . 3 |- ([y / x]ph <-> ps)
32bibi2i 606 . 2 |- (([y / x]ch <-> [y / x]ph) <-> ([y / x]ch <-> ps))
41, 3bitr 173 1 |- ([y / x](ch <-> ph) <-> ([y / x]ch <-> ps))
Colors of variables: wff set class
Syntax hints:   <-> wb 146  [wsbc 1166
This theorem is referenced by:  sb8eu 1383
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-10 963  ax-12 965  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-11o 1213
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978  df-sb 1168
Copyright terms: Public domain