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

Theorem sbcth 1936
Description: A substitution into a theorem remains true (when A is a set).
Hypothesis
Ref Expression
sbcth.1 |- ph
Assertion
Ref Expression
sbcth |- (A e. B -> [A / x]ph)

Proof of Theorem sbcth
StepHypRef Expression
1 sbcth.1 . . 3 |- ph
21ax-gen 960 . 2 |- A.xph
3 a4sbc 1935 . 2 |- (A e. B -> (A.xph -> [A / x]ph))
42, 3mpi 44 1 |- (A e. B -> [A / x]ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 951   e. wcel 955  [wsbc 1166
This theorem is referenced by:  sbcth2 1972  csbeq2i 2010
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 960  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-ext 1452
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978  df-sb 1168  df-clab 1457  df-cleq 1462  df-clel 1465  df-v 1803  df-sbc 1932
Copyright terms: Public domain