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

Theorem nfrmow 3395
Description: Bound-variable hypothesis builder for restricted uniqueness. Version of nfrmo 3411 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by NM, 16-Jun-2017.) Avoid ax-13 2402. (Revised by GG, 10-Jan-2024.) Avoid ax-9 2151, ax-ext 2733. (Revised by Wolf Lammen, 21-Nov-2024.)
Hypotheses
Ref Expression
nfrmow.1 𝑥𝐴
nfrmow.2 𝑥𝜑
Assertion
Ref Expression
nfrmow 𝑥∃*𝑦𝐴 𝜑
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem nfrmow
StepHypRef Expression
1 df-rmo 3366 . 2 (∃*𝑦𝐴 𝜑 ↔ ∃*𝑦(𝑦𝐴𝜑))
2 nfrmow.1 . . . . 5 𝑥𝐴
32nfcri 2915 . . . 4 𝑥 𝑦𝐴
4 nfrmow.2 . . . 4 𝑥𝜑
53, 4nfan 1918 . . 3 𝑥(𝑦𝐴𝜑)
65nfmov 2586 . 2 𝑥∃*𝑦(𝑦𝐴𝜑)
71, 6nfxfr 1872 1 𝑥∃*𝑦𝐴 𝜑
Colors of variables: wff setvar class
Syntax hints:  wa 399  wnf 1802  wcel 2141  ∃*wmo 2563  wnfc 2908  ∃*wrmo 3365
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-10 2174  ax-11 2190  ax-12 2211
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-mo 2565  df-clel 2836  df-nfc 2910  df-rmo 3366
This theorem is referenced by:  2rmorex  3716  2reurex  3722
  Copyright terms: Public domain W3C validator