Theorem euind 3689

Description: Existential uniqueness via an indirect equality. (Contributed by NM, 11-Oct-2010.)

Hypotheses

Ref	Expression
euind.1	⊢ 𝐵 ∈ V
euind.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
euind	⊢ ((∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃!𝑧∀𝑥(𝜑 → 𝑧 = 𝐴))

Distinct variable groups:   𝑦,𝑧,𝜑   𝑥,𝑧,𝜓   𝑦,𝐴,𝑧   𝑥,𝐵,𝑧   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem euind

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		euind.2	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2	1	cbvexvw 2070	. . . . 5 ⊢ (∃𝑥𝜑 ↔ ∃𝑦𝜓)
3		euind.1	. . . . . . . . 9 ⊢ 𝐵 ∈ V
4	3	isseti 3475	. . . . . . . 8 ⊢ ∃𝑧 𝑧 = 𝐵
5	4	biantrur 540	. . . . . . 7 ⊢ (𝜓 ↔ (∃𝑧 𝑧 = 𝐵 ∧ 𝜓))
6	5	exbii 1881	. . . . . 6 ⊢ (∃𝑦𝜓 ↔ ∃𝑦(∃𝑧 𝑧 = 𝐵 ∧ 𝜓))
7		19.41v 1982	. . . . . . 7 ⊢ (∃𝑧(𝑧 = 𝐵 ∧ 𝜓) ↔ (∃𝑧 𝑧 = 𝐵 ∧ 𝜓))
8	7	exbii 1881	. . . . . 6 ⊢ (∃𝑦∃𝑧(𝑧 = 𝐵 ∧ 𝜓) ↔ ∃𝑦(∃𝑧 𝑧 = 𝐵 ∧ 𝜓))
9		excom 2200	. . . . . 6 ⊢ (∃𝑦∃𝑧(𝑧 = 𝐵 ∧ 𝜓) ↔ ∃𝑧∃𝑦(𝑧 = 𝐵 ∧ 𝜓))
10	6, 8, 9	3bitr2i 302	. . . . 5 ⊢ (∃𝑦𝜓 ↔ ∃𝑧∃𝑦(𝑧 = 𝐵 ∧ 𝜓))
11	2, 10	bitri 278	. . . 4 ⊢ (∃𝑥𝜑 ↔ ∃𝑧∃𝑦(𝑧 = 𝐵 ∧ 𝜓))
12		eqeq2 2777	. . . . . . . . 9 ⊢ (𝐴 = 𝐵 → (𝑧 = 𝐴 ↔ 𝑧 = 𝐵))
13	12	imim2i 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → ((𝜑 ∧ 𝜓) → (𝑧 = 𝐴 ↔ 𝑧 = 𝐵)))
14		biimpr 223	. . . . . . . . . 10 ⊢ ((𝑧 = 𝐴 ↔ 𝑧 = 𝐵) → (𝑧 = 𝐵 → 𝑧 = 𝐴))
15	14	imim2i 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) → (𝑧 = 𝐴 ↔ 𝑧 = 𝐵)) → ((𝜑 ∧ 𝜓) → (𝑧 = 𝐵 → 𝑧 = 𝐴)))
16		an31 661	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝜓) ∧ 𝑧 = 𝐵) ↔ ((𝑧 = 𝐵 ∧ 𝜓) ∧ 𝜑))
17	16	imbi1i 352	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝜓) ∧ 𝑧 = 𝐵) → 𝑧 = 𝐴) ↔ (((𝑧 = 𝐵 ∧ 𝜓) ∧ 𝜑) → 𝑧 = 𝐴))
18		impexp 456	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝜓) ∧ 𝑧 = 𝐵) → 𝑧 = 𝐴) ↔ ((𝜑 ∧ 𝜓) → (𝑧 = 𝐵 → 𝑧 = 𝐴)))
19		impexp 456	. . . . . . . . . 10 ⊢ ((((𝑧 = 𝐵 ∧ 𝜓) ∧ 𝜑) → 𝑧 = 𝐴) ↔ ((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
20	17, 18, 19	3bitr3i 304	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) → (𝑧 = 𝐵 → 𝑧 = 𝐴)) ↔ ((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
21	15, 20	sylib 221	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) → (𝑧 = 𝐴 ↔ 𝑧 = 𝐵)) → ((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
22	13, 21	syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → ((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
23	22	2alimi 1845	. . . . . 6 ⊢ (∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → ∀𝑥∀𝑦((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
24		19.23v 1975	. . . . . . . 8 ⊢ (∀𝑦((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
25	24	albii 1852	. . . . . . 7 ⊢ (∀𝑥∀𝑦((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)) ↔ ∀𝑥(∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)))
26		19.21v 1972	. . . . . . 7 ⊢ (∀𝑥(∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → ∀𝑥(𝜑 → 𝑧 = 𝐴)))
27	25, 26	bitri 278	. . . . . 6 ⊢ (∀𝑥∀𝑦((𝑧 = 𝐵 ∧ 𝜓) → (𝜑 → 𝑧 = 𝐴)) ↔ (∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → ∀𝑥(𝜑 → 𝑧 = 𝐴)))
28	23, 27	sylib 221	. . . . 5 ⊢ (∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → (∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → ∀𝑥(𝜑 → 𝑧 = 𝐴)))
29	28	eximdv 1950	. . . 4 ⊢ (∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → (∃𝑧∃𝑦(𝑧 = 𝐵 ∧ 𝜓) → ∃𝑧∀𝑥(𝜑 → 𝑧 = 𝐴)))
30	11, 29	biimtrid 245	. . 3 ⊢ (∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) → (∃𝑥𝜑 → ∃𝑧∀𝑥(𝜑 → 𝑧 = 𝐴)))
31	30	imp 412	. 2 ⊢ ((∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃𝑧∀𝑥(𝜑 → 𝑧 = 𝐴))
32		pm4.24 574	. . . . . . . . 9 ⊢ (𝜑 ↔ (𝜑 ∧ 𝜑))
33	32	biimpi 219	. . . . . . . 8 ⊢ (𝜑 → (𝜑 ∧ 𝜑))
34		anim12 821	. . . . . . . 8 ⊢ (((𝜑 → 𝑧 = 𝐴) ∧ (𝜑 → 𝑤 = 𝐴)) → ((𝜑 ∧ 𝜑) → (𝑧 = 𝐴 ∧ 𝑤 = 𝐴)))
35		eqtr3 2787	. . . . . . . 8 ⊢ ((𝑧 = 𝐴 ∧ 𝑤 = 𝐴) → 𝑧 = 𝑤)
36	33, 34, 35	syl56 37	. . . . . . 7 ⊢ (((𝜑 → 𝑧 = 𝐴) ∧ (𝜑 → 𝑤 = 𝐴)) → (𝜑 → 𝑧 = 𝑤))
37	36	alanimi 1849	. . . . . 6 ⊢ ((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → ∀𝑥(𝜑 → 𝑧 = 𝑤))
38		19.23v 1975	. . . . . 6 ⊢ (∀𝑥(𝜑 → 𝑧 = 𝑤) ↔ (∃𝑥𝜑 → 𝑧 = 𝑤))
39	37, 38	sylib 221	. . . . 5 ⊢ ((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → (∃𝑥𝜑 → 𝑧 = 𝑤))
40	39	com12 33	. . . 4 ⊢ (∃𝑥𝜑 → ((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → 𝑧 = 𝑤))
41	40	alrimivv 1961	. . 3 ⊢ (∃𝑥𝜑 → ∀𝑧∀𝑤((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → 𝑧 = 𝑤))
42	41	adantl 487	. 2 ⊢ ((∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∀𝑧∀𝑤((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → 𝑧 = 𝑤))
43		eqeq1 2769	. . . . 5 ⊢ (𝑧 = 𝑤 → (𝑧 = 𝐴 ↔ 𝑤 = 𝐴))
44	43	imbi2d 343	. . . 4 ⊢ (𝑧 = 𝑤 → ((𝜑 → 𝑧 = 𝐴) ↔ (𝜑 → 𝑤 = 𝐴)))
45	44	albidv 1953	. . 3 ⊢ (𝑧 = 𝑤 → (∀𝑥(𝜑 → 𝑧 = 𝐴) ↔ ∀𝑥(𝜑 → 𝑤 = 𝐴)))
46	45	eu4 2645	. 2 ⊢ (∃!𝑧∀𝑥(𝜑 → 𝑧 = 𝐴) ↔ (∃𝑧∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑧∀𝑤((∀𝑥(𝜑 → 𝑧 = 𝐴) ∧ ∀𝑥(𝜑 → 𝑤 = 𝐴)) → 𝑧 = 𝑤)))
47	31, 42, 46	sylanbrc 595	1 ⊢ ((∀𝑥∀𝑦((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) ∧ ∃𝑥𝜑) → ∃!𝑧∀𝑥(𝜑 → 𝑧 = 𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146  ∃!weu 2598  Vcvv 3457

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2569  df-eu 2599  df-cleq 2757  df-clel 2840

This theorem is used by: (None)