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

Theorem nfraldw 3148
Description: Deduction version of nfralw 3151. Version of nfrald 3150 with a disjoint variable condition, which does not require ax-13 2373. (Contributed by NM, 15-Feb-2013.) (Revised by Gino Giotto, 24-Sep-2024.)
Hypotheses
Ref Expression
nfraldw.1 𝑦𝜑
nfraldw.2 (𝜑𝑥𝐴)
nfraldw.3 (𝜑 → Ⅎ𝑥𝜓)
Assertion
Ref Expression
nfraldw (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem nfraldw
StepHypRef Expression
1 df-ral 3070 . 2 (∀𝑦𝐴 𝜓 ↔ ∀𝑦(𝑦𝐴𝜓))
2 nfraldw.1 . . 3 𝑦𝜑
3 nfraldw.2 . . . . 5 (𝜑𝑥𝐴)
43nfcrd 2897 . . . 4 (𝜑 → Ⅎ𝑥 𝑦𝐴)
5 nfraldw.3 . . . 4 (𝜑 → Ⅎ𝑥𝜓)
64, 5nfimd 1900 . . 3 (𝜑 → Ⅎ𝑥(𝑦𝐴𝜓))
72, 6nfald 2325 . 2 (𝜑 → Ⅎ𝑥𝑦(𝑦𝐴𝜓))
81, 7nfxfrd 1859 1 (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1539  wnf 1789  wcel 2109  wnfc 2888  wral 3065
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-10 2140  ax-11 2157  ax-12 2174
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-ex 1786  df-nf 1790  df-clel 2817  df-nfc 2890  df-ral 3070
This theorem is referenced by:  nfralw  3151  nfrexd  3237  nfttrcld  9429
  Copyright terms: Public domain W3C validator