Theorem nfreuw 3395

Description: Bound-variable hypothesis builder for restricted unique existence. Version of nfreu 3411 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by NM, 30-Oct-2010.) 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
nfreuw	⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)

Proof of Theorem nfreuw

Step	Hyp	Ref	Expression
1		df-reu 3366	. 2 ⊢ (∃!𝑦 ∈ 𝐴 𝜑 ↔ ∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜑))
2		nfrmow.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	nfcri 2914	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
4		nfrmow.2	. . . 4 ⊢ Ⅎ𝑥𝜑
5	3, 4	nfan 1931	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜑)
6	5	nfeuw 2618	. 2 ⊢ Ⅎ𝑥∃!𝑦(𝑦 ∈ 𝐴 ∧ 𝜑)
7	1, 6	nfxfr 1885	1 ⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑

This proof depends on syntax axioms:   ∧ wa 401  Ⅎwnf 1815   ∈ wcel 2144  ∃!weu 2593  Ⅎwnfc 2907  ∃!wreu 3363

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-eu 2594  df-clel 2835  df-nfc 2909  df-reu 3366

This theorem is used by:  sbcreu  3822  reuccatpfxs1  14896  2reu7  48181  2reu8  48182  nfralseu  50931