Theorem nfreuxy 2651

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 1466	. . 3 ⊢ Ⅎ𝑦⊤
2		nfreuxy.1	. . . 4 ⊢ Ⅎ𝑥𝐴
3	2	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝐴)
4		nfreuxy.2	. . . 4 ⊢ Ⅎ𝑥𝜑
5	4	a1i 9	. . 3 ⊢ (⊤ → Ⅎ𝑥𝜑)
6	1, 3, 5	nfreudxy 2650	. 2 ⊢ (⊤ → Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑)
7	6	mptru 1362	1 ⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐴 𝜑

Syntax hints:  ⊤wtru 1354  Ⅎwnf 1460  Ⅎwnfc 2306  ∃!wreu 2457

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-cleq 2170  df-clel 2173  df-nfc 2308  df-reu 2462

This theorem is referenced by:  sbcreug  3043