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

Theorem nfrmow 3394
Description: Bound-variable hypothesis builder for restricted uniqueness. Version of nfrmo 3410 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by NM, 16-Jun-2017.) Avoid ax-13 2401. (Revised by GG, 10-Jan-2024.) Avoid ax-9 2154, ax-ext 2732. (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 3365 . 2 (∃*𝑦 ∈ 𝐴 𝜑 ↔ ∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜑))
2 nfrmow.1 . . . . 5 Ⅎ𝑥𝐴
32nfcri 2914 . . . 4 Ⅎ𝑥 𝑦 ∈ 𝐴
4 nfrmow.2 . . . 4 Ⅎ𝑥𝜑
53, 4nfan 1931 . . 3 Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜑)
65nfmov 2585 . 2 Ⅎ𝑥∃*𝑦(𝑦 ∈ 𝐴 ∧ 𝜑)
71, 6nfxfr 1885 1 Ⅎ𝑥∃*𝑦 ∈ 𝐴 𝜑
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401  Ⅎwnf 1815   ∈ wcel 2144  ∃*wmo 2562  Ⅎwnfc 2907  ∃*wrmo 3364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-10 2177  ax-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-mo 2564  df-clel 2835  df-nfc 2909  df-rmo 3365
This theorem is used by:  2rmorex  3711  2reurex  3717
  Copyright terms: Public domain W3C validator