Theorem euoreqb 43328

Description: There is a set which is equal to one of two other sets iff the other sets are equal. (Contributed by AV, 24-Jan-2023.)

Assertion

Ref	Expression
euoreqb	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ 𝐴 = 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑉

Proof of Theorem euoreqb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2825	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝐴 ↔ 𝑦 = 𝐴))
2		eqeq1 2825	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝐵 ↔ 𝑦 = 𝐵))
3	1, 2	orbi12d 915	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵)))
4	3	reu8 3724	. . 3 ⊢ (∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∃𝑥 ∈ 𝑉 ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦)))
5		simprlr 778	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐵 ∈ 𝑉)
6		eqeq1 2825	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐴 ↔ 𝐵 = 𝐴))
7		eqeq1 2825	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐵 ↔ 𝐵 = 𝐵))
8	6, 7	orbi12d 915	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐵 → ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) ↔ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵)))
9		eqeq2 2833	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐵 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐵))
10	8, 9	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) ↔ ((𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → 𝑥 = 𝐵)))
11	10	rspcv 3618	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑉 → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → ((𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → 𝑥 = 𝐵)))
12	5, 11	syl 17	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → ((𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → 𝑥 = 𝐵)))
13		ioran 980	. . . . . . . . . . . 12 ⊢ (¬ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵) ↔ (¬ 𝐵 = 𝐴 ∧ ¬ 𝐵 = 𝐵))
14		eqid 2821	. . . . . . . . . . . . 13 ⊢ 𝐵 = 𝐵
15	14	pm2.24i 153	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 = 𝐵 → ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
16	13, 15	simplbiim 507	. . . . . . . . . . 11 ⊢ (¬ (𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
17		eqtr2 2842	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐴 ∧ 𝑥 = 𝐵) → 𝐴 = 𝐵)
18	17	ancoms 461	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → 𝐴 = 𝐵)
19	18	a1d 25	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → 𝐴 = 𝐵))
20	19	expimpd 456	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐵 → ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
21	16, 20	ja 188	. . . . . . . . . 10 ⊢ (((𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → 𝑥 = 𝐵) → ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
22	21	com12 32	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (((𝐵 = 𝐴 ∨ 𝐵 = 𝐵) → 𝑥 = 𝐵) → 𝐴 = 𝐵))
23	12, 22	syld 47	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵))
24	23	ex 415	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵)))
25		simprll 777	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 ∈ 𝑉)
26		eqeq1 2825	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐴 → (𝑦 = 𝐴 ↔ 𝐴 = 𝐴))
27		eqeq1 2825	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝐴 → (𝑦 = 𝐵 ↔ 𝐴 = 𝐵))
28	26, 27	orbi12d 915	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) ↔ (𝐴 = 𝐴 ∨ 𝐴 = 𝐵)))
29		eqeq2 2833	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
30	28, 29	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) ↔ ((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → 𝑥 = 𝐴)))
31	30	rspcv 3618	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → ((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → 𝑥 = 𝐴)))
32	25, 31	syl 17	. . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → ((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → 𝑥 = 𝐴)))
33		ioran 980	. . . . . . . . . . . 12 ⊢ (¬ (𝐴 = 𝐴 ∨ 𝐴 = 𝐵) ↔ (¬ 𝐴 = 𝐴 ∧ ¬ 𝐴 = 𝐵))
34		eqid 2821	. . . . . . . . . . . . . 14 ⊢ 𝐴 = 𝐴
35	34	pm2.24i 153	. . . . . . . . . . . . 13 ⊢ (¬ 𝐴 = 𝐴 → ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
36	35	adantr 483	. . . . . . . . . . . 12 ⊢ ((¬ 𝐴 = 𝐴 ∧ ¬ 𝐴 = 𝐵) → ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
37	33, 36	sylbi 219	. . . . . . . . . . 11 ⊢ (¬ (𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
38	17	a1d 25	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐴 ∧ 𝑥 = 𝐵) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → 𝐴 = 𝐵))
39	38	expimpd 456	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
40	37, 39	ja 188	. . . . . . . . . 10 ⊢ (((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → 𝑥 = 𝐴) → ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → 𝐴 = 𝐵))
41	40	com12 32	. . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (((𝐴 = 𝐴 ∨ 𝐴 = 𝐵) → 𝑥 = 𝐴) → 𝐴 = 𝐵))
42	32, 41	syld 47	. . . . . . . 8 ⊢ ((𝑥 = 𝐵 ∧ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉)) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵))
43	42	ex 415	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵)))
44	24, 43	jaoi 853	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵)))
45	44	com12 32	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → (∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦) → 𝐴 = 𝐵)))
46	45	impd 413	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦)) → 𝐴 = 𝐵))
47	46	rexlimdva 3284	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (∃𝑥 ∈ 𝑉 ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ∀𝑦 ∈ 𝑉 ((𝑦 = 𝐴 ∨ 𝑦 = 𝐵) → 𝑥 = 𝑦)) → 𝐴 = 𝐵))
48	4, 47	syl5bi 244	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝐴 = 𝐵))
49		reueq 3728	. . . . . . 7 ⊢ (𝐵 ∈ 𝑉 ↔ ∃!𝑥 ∈ 𝑉 𝑥 = 𝐵)
50	49	biimpi 218	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → ∃!𝑥 ∈ 𝑉 𝑥 = 𝐵)
51	50	adantl 484	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → ∃!𝑥 ∈ 𝑉 𝑥 = 𝐵)
52	51	adantr 483	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → ∃!𝑥 ∈ 𝑉 𝑥 = 𝐵)
53		eqeq2 2833	. . . . . . . 8 ⊢ (𝐴 = 𝐵 → (𝑥 = 𝐴 ↔ 𝑥 = 𝐵))
54	53	adantl 484	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → (𝑥 = 𝐴 ↔ 𝑥 = 𝐵))
55	54	orbi1d 913	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ (𝑥 = 𝐵 ∨ 𝑥 = 𝐵)))
56		oridm 901	. . . . . 6 ⊢ ((𝑥 = 𝐵 ∨ 𝑥 = 𝐵) ↔ 𝑥 = 𝐵)
57	55, 56	syl6bb 289	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ 𝑥 = 𝐵))
58	57	reubidv 3389	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → (∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ ∃!𝑥 ∈ 𝑉 𝑥 = 𝐵))
59	52, 58	mpbird 259	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 = 𝐵) → ∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
60	59	ex 415	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴 = 𝐵 → ∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
61	48, 60	impbid 214	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (∃!𝑥 ∈ 𝑉 (𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ↔ 𝐴 = 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114  ∀wral 3138  ∃wrex 3139  ∃!wreu 3140

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-cleq 2814  df-clel 2893  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146

This theorem is referenced by:  quad1  43805  requad1  43807