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

Theorem sban 1237
Description: Conjunction inside and outside of a substitution are equivalent.
Assertion
Ref Expression
sban |- ([y / x](ph /\ ps) <-> ([y / x]ph /\ [y / x]ps))

Proof of Theorem sban
StepHypRef Expression
1 sbn 1231 . . 3 |- ([y / x] -. (ph -> -. ps) <-> -. [y / x](ph -> -. ps))
2 sbim 1234 . . . . 5 |- ([y / x](ph -> -. ps) <-> ([y / x]ph -> [y / x] -. ps))
3 sbn 1231 . . . . . 6 |- ([y / x] -. ps <-> -. [y / x]ps)
43imbi2i 185 . . . . 5 |- (([y / x]ph -> [y / x] -. ps) <-> ([y / x]ph -> -. [y / x]ps))
52, 4bitr 173 . . . 4 |- ([y / x](ph -> -. ps) <-> ([y / x]ph -> -. [y / x]ps))
65negbii 187 . . 3 |- (-. [y / x](ph -> -. ps) <-> -. ([y / x]ph -> -. [y / x]ps))
71, 6bitr 173 . 2 |- ([y / x] -. (ph -> -. ps) <-> -. ([y / x]ph -> -. [y / x]ps))
8 df-an 225 . . 3 |- ((ph /\ ps) <-> -. (ph -> -. ps))
98sbbii 1174 . 2 |- ([y / x](ph /\ ps) <-> [y / x] -. (ph -> -. ps))
10 df-an 225 . 2 |- (([y / x]ph /\ [y / x]ps) <-> -. ([y / x]ph -> -. [y / x]ps))
117, 9, 103bitr4 183 1 |- ([y / x](ph /\ ps) <-> ([y / x]ph /\ [y / x]ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  [wsbc 1170
This theorem is referenced by:  sb3an 1238  sbbi 1239  sbabel 1584  sbcang 1971  inab 2268  exss 2769  inopab 3268
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-10 966  ax-12 968  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172
Copyright terms: Public domain