Theorem reu2 3718

Description: A way to express restricted uniqueness. (Contributed by NM, 22-Nov-1994.)

Assertion

Ref	Expression
reu2	⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reu2

Step	Hyp	Ref	Expression
1		nfv 1910	. . 3 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
2	1	eu2 2600	. 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦)))
3		df-reu 3372	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
4		df-rex 3066	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5		df-ral 3057	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
6		19.21v 1935	. . . . . 6 ⊢ (∀𝑦(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
7		nfv 1910	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
8		nfs1v 2146	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
9	7, 8	nfan 1895	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)
10		eleq1w 2811	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
11		sbequ12 2236	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
12	10, 11	anbi12d 630	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)))
13	9, 12	sbiev 2303	. . . . . . . . . . 11 ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑))
14	13	anbi2i 622	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)))
15		an4 655	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
16	14, 15	bitri 275	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
17	16	imbi1i 349	. . . . . . . 8 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦))
18		impexp 450	. . . . . . . 8 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
19		impexp 450	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
20	17, 18, 19	3bitri 297	. . . . . . 7 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
21	20	albii 1814	. . . . . 6 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
22		df-ral 3057	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
23	22	imbi2i 336	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
24	6, 21, 23	3bitr4i 303	. . . . 5 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
25	24	albii 1814	. . . 4 ⊢ (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
26	5, 25	bitr4i 278	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦))
27	4, 26	anbi12i 626	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦)))
28	2, 3, 27	3bitr4i 303	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1532  ∃wex 1774  [wsb 2060   ∈ wcel 2099  ∃!weu 2557  ∀wral 3056  ∃wrex 3065  ∃!wreu 3369

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-10 2130  ax-11 2147  ax-12 2164

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clel 2805  df-ral 3057  df-rex 3066  df-reu 3372

This theorem is referenced by:  reu2eqd  3729  2nreu  4437  rexreusng  4679  disjinfi  44488