MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfral Structured version   Visualization version   GIF version

Theorem nfral 3153
Description: Bound-variable hypothesis builder for restricted quantification. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker nfralw 3151 when possible. (Contributed by NM, 1-Sep-1999.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfral.1 𝑥𝐴
nfral.2 𝑥𝜑
Assertion
Ref Expression
nfral 𝑥𝑦𝐴 𝜑

Proof of Theorem nfral
StepHypRef Expression
1 nftru 1807 . . 3 𝑦
2 nfral.1 . . . 4 𝑥𝐴
32a1i 11 . . 3 (⊤ → 𝑥𝐴)
4 nfral.2 . . . 4 𝑥𝜑
54a1i 11 . . 3 (⊤ → Ⅎ𝑥𝜑)
61, 3, 5nfrald 3150 . 2 (⊤ → Ⅎ𝑥𝑦𝐴 𝜑)
76mptru 1546 1 𝑥𝑦𝐴 𝜑
Colors of variables: wff setvar class
Syntax hints:  wtru 1540  wnf 1786  wnfc 2887  wral 3064
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069
This theorem is referenced by:  nfra2  3157  nfiing  4957  opreu2reuALT  30825  eliuniincex  42659  cbvral2  44595
  Copyright terms: Public domain W3C validator