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

Theorem 19.3 1912
 Description: A wff may be quantified with a variable not free in it. Theorem 19.3 of [Margaris] p. 89. See 19.3v 1779 for a version requiring fewer axioms. (Contributed by NM, 12-Mar-1993.) (Revised by Mario Carneiro, 24-Sep-2016.)
Hypothesis
Ref Expression
19.3.1
Assertion
Ref Expression
19.3

Proof of Theorem 19.3
StepHypRef Expression
1 sp 1883 . 2
2 19.3.1 . . 3
32nfri 1898 . 2
41, 3impbii 188 1
 Colors of variables: wff setvar class Syntax hints:   wb 184  wal 1403  wnf 1637 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-12 1878 This theorem depends on definitions:  df-bi 185  df-ex 1634  df-nf 1638 This theorem is referenced by:  19.27  1951  19.28  1952  19.16  1985  19.17  1986  19.37  1994  2eu4OLD  2332  axrep4  4510  zfcndrep  9021  bj-alexbiex  30804  bj-alalbial  30806  bj-axrep4  30928
 Copyright terms: Public domain W3C validator