Theorem supmo 9428

Description: Any class 𝐵 has at most one supremum in 𝐴 (where 𝑅 is interpreted as 'less than'). (Contributed by NM, 5-May-1999.) (Revised by Mario Carneiro, 24-Dec-2016.)

Hypothesis

Ref	Expression
supmo.1	⊢ (𝜑 → 𝑅 Or 𝐴)

Assertion

Ref	Expression
supmo	⊢ (𝜑 → ∃*𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)

Proof of Theorem supmo

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		supmo.1	. . 3 ⊢ (𝜑 → 𝑅 Or 𝐴)
2		ancom 466	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦) ↔ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦))
3	2	anbi2ci 637	. . . . . . 7 ⊢ (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦) ∧ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦)))
4		an42 670	. . . . . . 7 ⊢ (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦) ∧ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
5		an42 670	. . . . . . 7 ⊢ (((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦) ∧ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦)) ↔ ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦)))
6	3, 4, 5	3bitr4i 306	. . . . . 6 ⊢ (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) ↔ ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦) ∧ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦)))
7		ralnex 3089	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ↔ ¬ ∃𝑦 ∈ 𝐵 𝑥𝑅𝑦)
8		breq1 5106	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝑤 ↔ 𝑥𝑅𝑤))
9		breq1 5106	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑥𝑅𝑧))
10	9	rexbidv 3187	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑥 → (∃𝑧 ∈ 𝐵 𝑦𝑅𝑧 ↔ ∃𝑧 ∈ 𝐵 𝑥𝑅𝑧))
11	8, 10	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → ((𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (𝑥𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑥𝑅𝑧)))
12	11	rspcva 3575	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (𝑥𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑥𝑅𝑧))
13		breq2 5107	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝑧))
14	13	cbvrexvw 3242	. . . . . . . . . . . 12 ⊢ (∃𝑦 ∈ 𝐵 𝑥𝑅𝑦 ↔ ∃𝑧 ∈ 𝐵 𝑥𝑅𝑧)
15	12, 14	imbitrrdi 255	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (𝑥𝑅𝑤 → ∃𝑦 ∈ 𝐵 𝑥𝑅𝑦))
16	15	con3d 153	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (¬ ∃𝑦 ∈ 𝐵 𝑥𝑅𝑦 → ¬ 𝑥𝑅𝑤))
17	7, 16	biimtrid 245	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 → ¬ 𝑥𝑅𝑤))
18	17	expimpd 459	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦) → ¬ 𝑥𝑅𝑤))
19	18	ad2antrl 741	. . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦) → ¬ 𝑥𝑅𝑤))
20		ralnex 3089	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ↔ ¬ ∃𝑦 ∈ 𝐵 𝑤𝑅𝑦)
21		breq1 5106	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 → (𝑦𝑅𝑥 ↔ 𝑤𝑅𝑥))
22		breq1 5106	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑤 → (𝑦𝑅𝑧 ↔ 𝑤𝑅𝑧))
23	22	rexbidv 3187	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑤 → (∃𝑧 ∈ 𝐵 𝑦𝑅𝑧 ↔ ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
24	21, 23	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)))
25	24	rspcva 3575	. . . . . . . . . . . 12 ⊢ ((𝑤 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (𝑤𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧))
26		breq2 5107	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑧 → (𝑤𝑅𝑦 ↔ 𝑤𝑅𝑧))
27	26	cbvrexvw 3242	. . . . . . . . . . . 12 ⊢ (∃𝑦 ∈ 𝐵 𝑤𝑅𝑦 ↔ ∃𝑧 ∈ 𝐵 𝑤𝑅𝑧)
28	25, 27	imbitrrdi 255	. . . . . . . . . . 11 ⊢ ((𝑤 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (𝑤𝑅𝑥 → ∃𝑦 ∈ 𝐵 𝑤𝑅𝑦))
29	28	con3d 153	. . . . . . . . . 10 ⊢ ((𝑤 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (¬ ∃𝑦 ∈ 𝐵 𝑤𝑅𝑦 → ¬ 𝑤𝑅𝑥))
30	20, 29	biimtrid 245	. . . . . . . . 9 ⊢ ((𝑤 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) → (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 → ¬ 𝑤𝑅𝑥))
31	30	expimpd 459	. . . . . . . 8 ⊢ (𝑤 ∈ 𝐴 → ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦) → ¬ 𝑤𝑅𝑥))
32	31	ad2antll 742	. . . . . . 7 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦) → ¬ 𝑤𝑅𝑥))
33	19, 32	anim12d 621	. . . . . 6 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦) ∧ (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦)) → (¬ 𝑥𝑅𝑤 ∧ ¬ 𝑤𝑅𝑥)))
34	6, 33	biimtrid 245	. . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → (¬ 𝑥𝑅𝑤 ∧ ¬ 𝑤𝑅𝑥)))
35		sotrieq2 5591	. . . . 5 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑥 = 𝑤 ↔ (¬ 𝑥𝑅𝑤 ∧ ¬ 𝑤𝑅𝑥)))
36	34, 35	sylibrd 262	. . . 4 ⊢ ((𝑅 Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → 𝑥 = 𝑤))
37	36	ralrimivva 3206	. . 3 ⊢ (𝑅 Or 𝐴 → ∀𝑥 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → 𝑥 = 𝑤))
38	1, 37	syl 18	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → 𝑥 = 𝑤))
39		breq1 5106	. . . . . 6 ⊢ (𝑥 = 𝑤 → (𝑥𝑅𝑦 ↔ 𝑤𝑅𝑦))
40	39	notbid 321	. . . . 5 ⊢ (𝑥 = 𝑤 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑤𝑅𝑦))
41	40	ralbidv 3186	. . . 4 ⊢ (𝑥 = 𝑤 → (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦))
42		breq2 5107	. . . . . 6 ⊢ (𝑥 = 𝑤 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑤))
43	42	imbi1d 344	. . . . 5 ⊢ (𝑥 = 𝑤 → ((𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
44	43	ralbidv 3186	. . . 4 ⊢ (𝑥 = 𝑤 → (∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
45	41, 44	anbi12d 644	. . 3 ⊢ (𝑥 = 𝑤 → ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))))
46	45	rmo4 3688	. 2 ⊢ (∃*𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ∧ (∀𝑦 ∈ 𝐵 ¬ 𝑤𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑤 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))) → 𝑥 = 𝑤))
47	38, 46	sylibr 237	1 ⊢ (𝜑 → ∃*𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  ∃*wrmo 3365   class class class wbr 5103   Or wor 5558

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 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rmo 3366  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-po 5559  df-so 5560

This theorem is used by:  supexd  9429  supeu  9430