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

Theorem nfraldw 3311
Description: Deduction version of nfralw 3313. Version of nfrald 3361 with a disjoint variable condition, which does not require ax-13 2404. (Contributed by NM, 15-Feb-2013.) Avoid ax-9 2157, ax-ext 2735. (Revised by GG, 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 3081 . 2 (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
2 nfraldw.1 . . 3 Ⅎ𝑦𝜑
3 nfraldw.2 . . . . 5 (𝜑 → Ⅎ𝑥𝐴)
43nfcrd 2920 . . . 4 (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴)
5 nfraldw.3 . . . 4 (𝜑 → Ⅎ𝑥𝜓)
64, 5nfimd 1929 . . 3 (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 → 𝜓))
72, 6nfald 2362 . 2 (𝜑 → Ⅎ𝑥∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
81, 7nfxfrd 1887 1 (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1568  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-10 2180  ax-11 2197  ax-12 2216
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-clel 2839  df-nfc 2913  df-ral 3081
This theorem is used by:  nfrexdw  3312  nfttrcld  9735  nfchnd  18811
  Copyright terms: Public domain W3C validator