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

Theorem stdpc5 1773
 Description: An axiom scheme of standard predicate calculus that emulates Axiom 5 of [Mendelson] p. 69. The hypothesis can be thought of as emulating " is not free in ." With this definition, the meaning of "not free" is less restrictive than the usual textbook definition; for example would not (for us) be free in by nfequid 1688. This theorem scheme can be proved as a metatheorem of Mendelson's axiom system, even though it is slightly stronger than his Axiom 5. (Contributed by NM, 22-Sep-1993.) (Revised by Mario Carneiro, 12-Oct-2016.)
Hypothesis
Ref Expression
stdpc5.1
Assertion
Ref Expression
stdpc5

Proof of Theorem stdpc5
StepHypRef Expression
1 stdpc5.1 . . 3
21nfri 1703 . 2
3 alim 1548 . 2
42, 3syl5 30 1
 Colors of variables: wff set class Syntax hints:   wi 6  wal 1532  wnf 1539 This theorem is referenced by:  ra5  3005  ax10ext  26772 This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-4 1692 This theorem depends on definitions:  df-bi 179  df-nf 1540
 Copyright terms: Public domain W3C validator