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

Theorem nfrexd 3305
Description: Deduction version of nfrex 3307. (Contributed by Mario Carneiro, 14-Oct-2016.) Add disjoint variable condition to avoid ax-13 2383. See nfrexdg 3306 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.)
Hypotheses
Ref Expression
nfrexd.1 𝑦𝜑
nfrexd.2 (𝜑𝑥𝐴)
nfrexd.3 (𝜑 → Ⅎ𝑥𝜓)
Assertion
Ref Expression
nfrexd (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem nfrexd
StepHypRef Expression
1 dfrex2 3237 . 2 (∃𝑦𝐴 𝜓 ↔ ¬ ∀𝑦𝐴 ¬ 𝜓)
2 nfrexd.1 . . . 4 𝑦𝜑
3 nfrexd.2 . . . 4 (𝜑𝑥𝐴)
4 nfrexd.3 . . . . 5 (𝜑 → Ⅎ𝑥𝜓)
54nfnd 1851 . . . 4 (𝜑 → Ⅎ𝑥 ¬ 𝜓)
62, 3, 5nfraldw 3221 . . 3 (𝜑 → Ⅎ𝑥𝑦𝐴 ¬ 𝜓)
76nfnd 1851 . 2 (𝜑 → Ⅎ𝑥 ¬ ∀𝑦𝐴 ¬ 𝜓)
81, 7nfxfrd 1847 1 (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wnf 1777  wnfc 2959  wral 3136  wrex 3137
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1774  df-nf 1778  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142
This theorem is referenced by:  nfrex  3307  nfunid  4836  nfiund  44767
  Copyright terms: Public domain W3C validator