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

Theorem stdpc5 1793
 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 1645. 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 1742 . 2
3 alim 1545 . 2
42, 3syl5 28 1
 Colors of variables: wff set class Syntax hints:   wi 4  wal 1527  wnf 1531 This theorem is referenced by:  ra5  3075  ax10ext  27606 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-11 1715 This theorem depends on definitions:  df-bi 177  df-nf 1532
 Copyright terms: Public domain W3C validator