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

Theorem sbcie 1958
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 1957 . 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 954   e. wcel 956  [wsbc 1168  Vcvv 1807
This theorem is referenced by:  intab 2555  tfinds2 3160
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-an 225  df-3an 776  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  df-v 1808  df-sbc 1938
Copyright terms: Public domain