Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  stdpc4 Structured version   Unicode version

Theorem stdpc4 2087
 Description: The specialization axiom of standard predicate calculus. It states that if a statement holds for all , then it also holds for the specific case of (properly) substituted for . Translated to traditional notation, it can be read: " , provided that is free for in ." Axiom 4 of [Mendelson] p. 69. See also spsbc 3165 and rspsbc 3231. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
stdpc4

Proof of Theorem stdpc4
StepHypRef Expression
1 ax-1 5 . . 3
21alimi 1568 . 2
3 sb2 2086 . 2
42, 3syl 16 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1549  wsb 1658 This theorem is referenced by:  sbft  2103  sbftOLD  2104  spsbeOLD  2149  spsbim  2150  spsbbi  2151  sb9i  2169  pm13.183  3068  spsbc  3165  nd1  8452  nd2  8453  pm10.14  27486  stdpc4-2  27501  pm11.57  27520 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-11 1761  ax-12 1950 This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1551  df-sb 1659
 Copyright terms: Public domain W3C validator