Theorem reu8nf 3133

Description: Restricted uniqueness using implicit substitution. This version of reu8 3022 uses a nonfreeness hypothesis for 𝑥 and 𝜓 instead of distinct variable conditions. (Contributed by AV, 21-Jan-2022.)

Hypotheses

Ref	Expression
reu8nf.1	⊢ Ⅎ𝑥𝜓
reu8nf.2	⊢ Ⅎ𝑥𝜒
reu8nf.3	⊢ (𝑥 = 𝑤 → (𝜑 ↔ 𝜒))
reu8nf.4	⊢ (𝑤 = 𝑦 → (𝜒 ↔ 𝜓))

Assertion

Ref	Expression
reu8nf	⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))

Distinct variable groups:   𝑥,𝑤,𝑦,𝐴   𝜑,𝑤   𝜓,𝑤   𝜒,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑤)

Proof of Theorem reu8nf

Step	Hyp	Ref	Expression
1		nfv 1581	. . 3 ⊢ Ⅎ𝑤𝜑
2		reu8nf.2	. . 3 ⊢ Ⅎ𝑥𝜒
3		reu8nf.3	. . 3 ⊢ (𝑥 = 𝑤 → (𝜑 ↔ 𝜒))
4	1, 2, 3	cbvreuw 2781	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑤 ∈ 𝐴 𝜒)
5		reu8nf.4	. . 3 ⊢ (𝑤 = 𝑦 → (𝜒 ↔ 𝜓))
6	5	reu8 3022	. 2 ⊢ (∃!𝑤 ∈ 𝐴 𝜒 ↔ ∃𝑤 ∈ 𝐴 (𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)))
7		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥𝐴
8		reu8nf.1	. . . . . 6 ⊢ Ⅎ𝑥𝜓
9		nfv 1581	. . . . . 6 ⊢ Ⅎ𝑥 𝑤 = 𝑦
10	8, 9	nfim 1625	. . . . 5 ⊢ Ⅎ𝑥(𝜓 → 𝑤 = 𝑦)
11	7, 10	nfralw 2587	. . . 4 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)
12	2, 11	nfan 1618	. . 3 ⊢ Ⅎ𝑥(𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦))
13		nfv 1581	. . 3 ⊢ Ⅎ𝑤(𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))
14	3	bicomd 141	. . . . 5 ⊢ (𝑥 = 𝑤 → (𝜒 ↔ 𝜑))
15	14	equcoms 1760	. . . 4 ⊢ (𝑤 = 𝑥 → (𝜒 ↔ 𝜑))
16		equequ1 1764	. . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝑦 ↔ 𝑥 = 𝑦))
17	16	imbi2d 230	. . . . 5 ⊢ (𝑤 = 𝑥 → ((𝜓 → 𝑤 = 𝑦) ↔ (𝜓 → 𝑥 = 𝑦)))
18	17	ralbidv 2550	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
19	15, 18	anbi12d 477	. . 3 ⊢ (𝑤 = 𝑥 → ((𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)) ↔ (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))))
20	12, 13, 19	cbvrexw 2780	. 2 ⊢ (∃𝑤 ∈ 𝐴 (𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)) ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
21	4, 6, 20	3bitri 206	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  Ⅎwnf 1513  ∀wral 2528  ∃wrex 2529  ∃!wreu 2530

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-v 2823

This theorem is used by:  reuccatpfxs1  11535