Theorem reu8nf 3829

Description: Restricted uniqueness using implicit substitution. This version of reu8 3695 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 1943	. . 3 ⊢ Ⅎ𝑤𝜑
2		reu8nf.2	. . 3 ⊢ Ⅎ𝑥𝜒
3		reu8nf.3	. . 3 ⊢ (𝑥 = 𝑤 → (𝜑 ↔ 𝜒))
4	1, 2, 3	cbvreuw 3394	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑤 ∈ 𝐴 𝜒)
5		reu8nf.4	. . 3 ⊢ (𝑤 = 𝑦 → (𝜒 ↔ 𝜓))
6	5	reu8 3695	. 2 ⊢ (∃!𝑤 ∈ 𝐴 𝜒 ↔ ∃𝑤 ∈ 𝐴 (𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)))
7		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑥𝐴
8		reu8nf.1	. . . . . 6 ⊢ Ⅎ𝑥𝜓
9		nfv 1943	. . . . . 6 ⊢ Ⅎ𝑥 𝑤 = 𝑦
10	8, 9	nfim 1925	. . . . 5 ⊢ Ⅎ𝑥(𝜓 → 𝑤 = 𝑦)
11	7, 10	nfralw 3311	. . . 4 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)
12	2, 11	nfan 1928	. . 3 ⊢ Ⅎ𝑥(𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦))
13		nfv 1943	. . 3 ⊢ Ⅎ𝑤(𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))
14	3	bicomd 226	. . . . 5 ⊢ (𝑥 = 𝑤 → (𝜒 ↔ 𝜑))
15	14	equcoms 2049	. . . 4 ⊢ (𝑤 = 𝑥 → (𝜒 ↔ 𝜑))
16		equequ1 2054	. . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝑦 ↔ 𝑥 = 𝑦))
17	16	imbi2d 343	. . . . 5 ⊢ (𝑤 = 𝑥 → ((𝜓 → 𝑤 = 𝑦) ↔ (𝜓 → 𝑥 = 𝑦)))
18	17	ralbidv 3187	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
19	15, 18	anbi12d 643	. . 3 ⊢ (𝑤 = 𝑥 → ((𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)) ↔ (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦))))
20	12, 13, 19	cbvrexw 3307	. 2 ⊢ (∃𝑤 ∈ 𝐴 (𝜒 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑤 = 𝑦)) ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))
21	4, 6, 20	3bitri 300	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥 ∈ 𝐴 (𝜑 ∧ ∀𝑦 ∈ 𝐴 (𝜓 → 𝑥 = 𝑦)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400  Ⅎwnf 1812  ∀wral 3078  ∃wrex 3088  ∃!wreu 3366

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-10 2175  ax-11 2191  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369

This theorem is used by:  reusngf  4639  reuprg0  4667  reuop  6294  reuccatpfxs1  14791  reupr  48299