Theorem reu2 3689

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 1944	. . 3 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
2	1	eu2 2637	. 2 ⊢ (∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦)))
3		df-reu 3370	. 2 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
4		df-rex 3090	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
5		df-ral 3080	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
6		19.21v 1969	. . . . . 6 ⊢ (∀𝑦(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
7		nfv 1944	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
8		nfs1v 2191	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
9	7, 8	nfan 1929	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)
10		eleq1w 2846	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
11		sbequ12 2287	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
12	10, 11	anbi12d 643	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)))
13	9, 12	sbiev 2347	. . . . . . . . . . 11 ⊢ ([𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑))
14	13	anbi2i 634	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)))
15		an4 668	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
16	14, 15	bitri 278	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
17	16	imbi1i 352	. . . . . . . 8 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦))
18		impexp 455	. . . . . . . 8 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
19		impexp 455	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
20	17, 18, 19	3bitri 300	. . . . . . 7 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
21	20	albii 1849	. . . . . 6 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
22		df-ral 3080	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
23	22	imbi2i 339	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦(𝑦 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
24	6, 21, 23	3bitr4i 306	. . . . 5 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
25	24	albii 1849	. . . 4 ⊢ (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
26	5, 25	bitr4i 281	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦))
27	4, 26	anbi12i 639	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦)))
28	2, 3, 27	3bitr4i 306	1 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1568  ∃wex 1809  [wsb 2096   ∈ wcel 2143  ∃!weu 2596  ∀wral 3079  ∃wrex 3089  ∃!wreu 3367

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-10 2176  ax-11 2192  ax-12 2213

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clel 2838  df-ral 3080  df-rex 3090  df-reu 3370

This theorem is referenced by:  reu2eqd  3700  2nreu  4410  rexreusng  4646  disjinfi  45893