Theorem nfreuxy 2672

Description: Not-free for restricted uniqueness. This is a version where 𝑥 and 𝑦 are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)

Hypotheses

Ref	Expression
nfreuxy.1	⊢ Ⅎ𝑥𝐴
nfreuxy.2	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
nfreuxy	⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem nfreuxy

Step	Hyp	Ref	Expression
1		nftru 1480	. . 3 ⊢ Ⅎ𝑦⊤
2		nfreuxy.1	. . . 4 ⊢ Ⅎ𝑥𝐴
3	2	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝐴)
4		nfreuxy.2	. . . 4 ⊢ Ⅎ𝑥𝜑
5	4	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
6	1, 3, 5	nfreudxy 2671	. 2 ⊢ (⊤ → Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑)
7	6	mptru 1373	1 ⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑

Syntax hints:  ⊤wtru 1365  Ⅎwnf 1474  Ⅎwnfc 2326  ∃!wreu 2477

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-cleq 2189  df-clel 2192  df-nfc 2328  df-reu 2482

This theorem is referenced by:  sbcreug  3070