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

Theorem a4sbbi 1247
Description: Specialization of biconditional.
Assertion
Ref Expression
a4sbbi |- (A.x(ph <-> ps) -> ([y / x]ph <-> [y / x]ps))

Proof of Theorem a4sbbi
StepHypRef Expression
1 stdpc4 1187 . 2 |- (A.x(ph <-> ps) -> [y / x](ph <-> ps))
2 sbbi 1241 . 2 |- ([y / x](ph <-> ps) <-> ([y / x]ph <-> [y / x]ps))
31, 2sylib 198 1 |- (A.x(ph <-> ps) -> ([y / x]ph <-> [y / x]ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 956  [wsbc 1172
This theorem is referenced by:  sbbid 1248  hbsb4t 1251  sbco3 1259
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-10 968  ax-12 970  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-11o 1220
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983  df-sb 1174
Copyright terms: Public domain