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

Theorem sbcie 1962
Description: Conversion of implicit substitution to explicit class substitution.
Hypotheses
Ref Expression
sbcie.1 |- A e. V
sbcie.2 |- (x = A -> (ph <-> ps))
Assertion
Ref Expression
sbcie |- ([A / x]ph <-> ps)
Distinct variable groups:   x,A   ps,x

Proof of Theorem sbcie
StepHypRef Expression
1 sbcie.1 . 2 |- A e. V
2 sbcie.2 . . 3 |- (x = A -> (ph <-> ps))
32sbcieg 1961 . 2 |- (A e. V -> ([A / x]ph <-> ps))
41, 3ax-mp 7 1 |- ([A / x]ph <-> ps)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 956   e. wcel 958  [wsbc 1170  Vcvv 1811
This theorem is referenced by:  intab 2560  tfinds2 3165
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-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812  df-sbc 1942
Copyright terms: Public domain