Theorem prproropf1olem4 47192

Description: Lemma 4 for prproropf1o 47193. (Contributed by AV, 14-Mar-2023.)

Hypotheses

Ref	Expression
prproropf1o.o	⊢ 𝑂 = (𝑅 ∩ (𝑉 × 𝑉))
prproropf1o.p	⊢ 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2}
prproropf1o.f	⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩)

Assertion

Ref	Expression
prproropf1olem4	⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → ((𝐹‘𝑍) = (𝐹‘𝑊) → 𝑍 = 𝑊))

Distinct variable groups:   𝑉,𝑝   𝑊,𝑝   𝑂,𝑝   𝑃,𝑝   𝑅,𝑝   𝑍,𝑝

Allowed substitution hint:   𝐹(𝑝)

Proof of Theorem prproropf1olem4

Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prproropf1o.f	. . . 4 ⊢ 𝐹 = (𝑝 ∈ 𝑃 ↦ ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩)
2		infeq1 9521	. . . . 5 ⊢ (𝑝 = 𝑍 → inf(𝑝, 𝑉, 𝑅) = inf(𝑍, 𝑉, 𝑅))
3		supeq1 9490	. . . . 5 ⊢ (𝑝 = 𝑍 → sup(𝑝, 𝑉, 𝑅) = sup(𝑍, 𝑉, 𝑅))
4	2, 3	opeq12d 4890	. . . 4 ⊢ (𝑝 = 𝑍 → ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩ = ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩)
5		simp3 1135	. . . 4 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → 𝑍 ∈ 𝑃)
6		opex 5472	. . . . 5 ⊢ ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ ∈ V
7	6	a1i 11	. . . 4 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ ∈ V)
8	1, 4, 5, 7	fvmptd3 7035	. . 3 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → (𝐹‘𝑍) = ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩)
9		infeq1 9521	. . . . 5 ⊢ (𝑝 = 𝑊 → inf(𝑝, 𝑉, 𝑅) = inf(𝑊, 𝑉, 𝑅))
10		supeq1 9490	. . . . 5 ⊢ (𝑝 = 𝑊 → sup(𝑝, 𝑉, 𝑅) = sup(𝑊, 𝑉, 𝑅))
11	9, 10	opeq12d 4890	. . . 4 ⊢ (𝑝 = 𝑊 → ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩)
12		simp2 1134	. . . 4 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → 𝑊 ∈ 𝑃)
13		opex 5472	. . . . 5 ⊢ ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ ∈ V
14	13	a1i 11	. . . 4 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ ∈ V)
15	1, 11, 12, 14	fvmptd3 7035	. . 3 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → (𝐹‘𝑊) = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩)
16	8, 15	eqeq12d 2745	. 2 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → ((𝐹‘𝑍) = (𝐹‘𝑊) ↔ ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩))
17		prproropf1o.p	. . . . 5 ⊢ 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2}
18	17	prpair 47187	. . . 4 ⊢ (𝑍 ∈ 𝑃 ↔ ∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑))
19	17	prpair 47187	. . . . 5 ⊢ (𝑊 ∈ 𝑃 ↔ ∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏))
20		id 22	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 Or 𝑉 → 𝑅 Or 𝑉)
21	20	infexd 9528	. . . . . . . . . . . . . . 15 ⊢ (𝑅 Or 𝑉 → inf({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V)
22	20	supexd 9498	. . . . . . . . . . . . . . 15 ⊢ (𝑅 Or 𝑉 → sup({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V)
23	21, 22	jca 510	. . . . . . . . . . . . . 14 ⊢ (𝑅 Or 𝑉 → (inf({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V))
24	23	ad4antr 730	. . . . . . . . . . . . 13 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V))
25		opthg 5485	. . . . . . . . . . . . 13 ⊢ ((inf({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) ∈ V) → (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅))))
26	24, 25	syl 17	. . . . . . . . . . . 12 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅))))
27		solin 5621	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎))
28		infpr 9548	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑅 Or 𝑉 ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → inf({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑎𝑅𝑏, 𝑎, 𝑏))
29	28	3expb 1117	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → inf({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑎𝑅𝑏, 𝑎, 𝑏))
30		iftrue 4540	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑎)
31	29, 30	sylan9eqr 2791	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → inf({𝑎, 𝑏}, 𝑉, 𝑅) = 𝑎)
32	31	eqeq2d 2740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ↔ inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎))
33		suppr 9516	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑅 Or 𝑉 ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → sup({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑏𝑅𝑎, 𝑎, 𝑏))
34	33	3expb 1117	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → sup({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑏𝑅𝑎, 𝑎, 𝑏))
35	34	adantl 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → sup({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑏𝑅𝑎, 𝑎, 𝑏))
36		sotric 5624	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎𝑅𝑏 ↔ ¬ (𝑎 = 𝑏 ∨ 𝑏𝑅𝑎)))
37		ioran 981	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (¬ (𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) ↔ (¬ 𝑎 = 𝑏 ∧ ¬ 𝑏𝑅𝑎))
38		iffalse 4543	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (¬ 𝑏𝑅𝑎 → if(𝑏𝑅𝑎, 𝑎, 𝑏) = 𝑏)
39	37, 38	simplbiim 503	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (¬ (𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) → if(𝑏𝑅𝑎, 𝑎, 𝑏) = 𝑏)
40	36, 39	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎𝑅𝑏 → if(𝑏𝑅𝑎, 𝑎, 𝑏) = 𝑏))
41	40	impcom 406	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → if(𝑏𝑅𝑎, 𝑎, 𝑏) = 𝑏)
42	35, 41	eqtrd 2769	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → sup({𝑎, 𝑏}, 𝑉, 𝑅) = 𝑏)
43	42	eqeq2d 2740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅) ↔ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏))
44	32, 43	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏)))
45	44	adantr 479	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏)))
46		solin 5621	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑅 Or 𝑉 ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐𝑅𝑑 ∨ 𝑐 = 𝑑 ∨ 𝑑𝑅𝑐))
47	46	adantrr 715	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑐𝑅𝑑 ∨ 𝑐 = 𝑑 ∨ 𝑑𝑅𝑐))
48		simpl 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → 𝑅 Or 𝑉)
49		simprll 777	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → 𝑐 ∈ 𝑉)
50		simprlr 778	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → 𝑑 ∈ 𝑉)
51		infpr 9548	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ 𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) → inf({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑐𝑅𝑑, 𝑐, 𝑑))
52	48, 49, 50, 51	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → inf({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑐𝑅𝑑, 𝑐, 𝑑))
53		iftrue 4540	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑐𝑅𝑑 → if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑐)
54	52, 53	sylan9eqr 2791	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑐)
55	54	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ↔ 𝑐 = 𝑎))
56		suppr 9516	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝑅 Or 𝑉 ∧ 𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) → sup({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑑𝑅𝑐, 𝑐, 𝑑))
57	48, 49, 50, 56	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → sup({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑑𝑅𝑐, 𝑐, 𝑑))
58	57	adantl 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → sup({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑑𝑅𝑐, 𝑐, 𝑑))
59		sotric 5624	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ ((𝑅 Or 𝑉 ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐𝑅𝑑 ↔ ¬ (𝑐 = 𝑑 ∨ 𝑑𝑅𝑐)))
60	59	adantrr 715	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑐𝑅𝑑 ↔ ¬ (𝑐 = 𝑑 ∨ 𝑑𝑅𝑐)))
61		ioran 981	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (¬ (𝑐 = 𝑑 ∨ 𝑑𝑅𝑐) ↔ (¬ 𝑐 = 𝑑 ∧ ¬ 𝑑𝑅𝑐))
62		iffalse 4543	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (¬ 𝑑𝑅𝑐 → if(𝑑𝑅𝑐, 𝑐, 𝑑) = 𝑑)
63	61, 62	simplbiim 503	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (¬ (𝑐 = 𝑑 ∨ 𝑑𝑅𝑐) → if(𝑑𝑅𝑐, 𝑐, 𝑑) = 𝑑)
64	60, 63	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑐𝑅𝑑 → if(𝑑𝑅𝑐, 𝑐, 𝑑) = 𝑑))
65	64	impcom 406	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → if(𝑑𝑅𝑐, 𝑐, 𝑑) = 𝑑)
66	58, 65	eqtrd 2769	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑑)
67	66	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ↔ 𝑑 = 𝑏))
68	55, 67	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) ↔ (𝑐 = 𝑎 ∧ 𝑑 = 𝑏)))
69		orc 865	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
70	68, 69	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
71	70	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑐𝑅𝑑 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
72		eqneqall 2944	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑐 = 𝑑 → (𝑐 ≠ 𝑑 → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
73	72	adantld 489	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑐 = 𝑑 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
74	73	adantld 489	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑐 = 𝑑 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
75	52	adantl 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → inf({𝑐, 𝑑}, 𝑉, 𝑅) = if(𝑐𝑅𝑑, 𝑐, 𝑑))
76	75	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ↔ if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎))
77		iftrue 4540	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ (𝑑𝑅𝑐 → if(𝑑𝑅𝑐, 𝑐, 𝑑) = 𝑐)
78	57, 77	sylan9eqr 2791	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑐)
79	78	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ↔ 𝑐 = 𝑏))
80	76, 79	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) ↔ (if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ∧ 𝑐 = 𝑏)))
81		simpl 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉))
82	81	ancomd 460	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → (𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉))
83		sotric 5624	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝑅 Or 𝑉 ∧ (𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉)) → (𝑑𝑅𝑐 ↔ ¬ (𝑑 = 𝑐 ∨ 𝑐𝑅𝑑)))
84	82, 83	sylan2 591	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑑𝑅𝑐 ↔ ¬ (𝑑 = 𝑐 ∨ 𝑐𝑅𝑑)))
85		ioran 981	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (¬ (𝑑 = 𝑐 ∨ 𝑐𝑅𝑑) ↔ (¬ 𝑑 = 𝑐 ∧ ¬ 𝑐𝑅𝑑))
86		iffalse 4543	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (¬ 𝑐𝑅𝑑 → if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑑)
87	85, 86	simplbiim 503	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (¬ (𝑑 = 𝑐 ∨ 𝑐𝑅𝑑) → if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑑)
88	87	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (¬ (𝑑 = 𝑐 ∨ 𝑐𝑅𝑑) → (if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ↔ 𝑑 = 𝑎))
89	84, 88	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑑𝑅𝑐 → (if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ↔ 𝑑 = 𝑎)))
90	89	impcom 406	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ↔ 𝑑 = 𝑎))
91	90	anbi1d 629	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ∧ 𝑐 = 𝑏) ↔ (𝑑 = 𝑎 ∧ 𝑐 = 𝑏)))
92		olc 866	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑐 = 𝑏 ∧ 𝑑 = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
93	92	ancoms 457	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑 = 𝑎 ∧ 𝑐 = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
94	91, 93	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑎 ∧ 𝑐 = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
95	80, 94	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
96	95	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑑𝑅𝑐 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
97	71, 74, 96	3jaoi 1425	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑐𝑅𝑑 ∨ 𝑐 = 𝑑 ∨ 𝑑𝑅𝑐) → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
98	47, 97	mpcom 38	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
99	98	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑅 Or 𝑉 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
100	99	ad2antrl 726	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
101	100	imp 405	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
102	45, 101	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
103	102	ex 411	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
104	103	a1d 25	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑎𝑅𝑏 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))))
105	104	ex 411	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎𝑅𝑏 → ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))))
106		eqneqall 2944	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑎 = 𝑏 → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))))
107	106	a1d 25	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 = 𝑏 → ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))))
108	29	adantl 480	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → inf({𝑎, 𝑏}, 𝑉, 𝑅) = if(𝑎𝑅𝑏, 𝑎, 𝑏))
109		sotric 5624	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑅 Or 𝑉 ∧ (𝑏 ∈ 𝑉 ∧ 𝑎 ∈ 𝑉)) → (𝑏𝑅𝑎 ↔ ¬ (𝑏 = 𝑎 ∨ 𝑎𝑅𝑏)))
110	109	ancom2s 648	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑏𝑅𝑎 ↔ ¬ (𝑏 = 𝑎 ∨ 𝑎𝑅𝑏)))
111		ioran 981	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (¬ (𝑏 = 𝑎 ∨ 𝑎𝑅𝑏) ↔ (¬ 𝑏 = 𝑎 ∧ ¬ 𝑎𝑅𝑏))
112		iffalse 4543	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (¬ 𝑎𝑅𝑏 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
113	111, 112	simplbiim 503	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (¬ (𝑏 = 𝑎 ∨ 𝑎𝑅𝑏) → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
114	110, 113	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑏𝑅𝑎 → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏))
115	114	impcom 406	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → if(𝑎𝑅𝑏, 𝑎, 𝑏) = 𝑏)
116	108, 115	eqtrd 2769	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → inf({𝑎, 𝑏}, 𝑉, 𝑅) = 𝑏)
117	116	eqeq2d 2740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ↔ inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏))
118		iftrue 4540	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑏𝑅𝑎 → if(𝑏𝑅𝑎, 𝑎, 𝑏) = 𝑎)
119	34, 118	sylan9eqr 2791	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → sup({𝑎, 𝑏}, 𝑉, 𝑅) = 𝑎)
120	119	eqeq2d 2740	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅) ↔ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎))
121	117, 120	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎)))
122	121	adantr 479	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) ↔ (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎)))
123	54	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ↔ 𝑐 = 𝑏))
124	66	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ↔ 𝑑 = 𝑎))
125	123, 124	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) ↔ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
126	125, 92	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑐𝑅𝑑 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
127	126	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑐𝑅𝑑 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
128		eqneqall 2944	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑐 = 𝑑 → (𝑐 ≠ 𝑑 → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
129	128	adantld 489	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑐 = 𝑑 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
130	129	adantld 489	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑐 = 𝑑 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
131	84, 87	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → (𝑑𝑅𝑐 → if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑑))
132	131	impcom 406	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → if(𝑐𝑅𝑑, 𝑐, 𝑑) = 𝑑)
133	75, 132	eqtrd 2769	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑑)
134	133	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ↔ 𝑑 = 𝑏))
135	78	eqeq1d 2731	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → (sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎 ↔ 𝑐 = 𝑎))
136	134, 135	anbi12d 630	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) ↔ (𝑑 = 𝑏 ∧ 𝑐 = 𝑎)))
137	69	ancoms 457	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝑑 = 𝑏 ∧ 𝑐 = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
138	136, 137	biimtrdi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝑑𝑅𝑐 ∧ (𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑))) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
139	138	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑑𝑅𝑐 → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
140	127, 130, 139	3jaoi 1425	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑐𝑅𝑑 ∨ 𝑐 = 𝑑 ∨ 𝑑𝑅𝑐) → ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
141	47, 140	mpcom 38	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑅 Or 𝑉 ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
142	141	ex 411	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑅 Or 𝑉 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
143	142	ad2antrl 726	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
144	143	imp 405	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑏 ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = 𝑎) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
145	122, 144	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) ∧ ((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
146	145	ex 411	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
147	146	a1d 25	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑏𝑅𝑎 ∧ (𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉))) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))))
148	147	ex 411	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏𝑅𝑎 → ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))))
149	105, 107, 148	3jaoi 1425	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑎𝑅𝑏 ∨ 𝑎 = 𝑏 ∨ 𝑏𝑅𝑎) → ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))))
150	27, 149	mpcom 38	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → (𝑎 ≠ 𝑏 → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))))
151	150	adantld 489	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))))
152	151	imp 405	. . . . . . . . . . . . . . . 16 ⊢ (((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) → (((𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
153	152	expdimp 451	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑐 ≠ 𝑑 → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
154	153	adantld 489	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → ((𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))))
155	154	imp 405	. . . . . . . . . . . . 13 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎))))
156		vex 3476	. . . . . . . . . . . . . 14 ⊢ 𝑐 ∈ V
157		vex 3476	. . . . . . . . . . . . . 14 ⊢ 𝑑 ∈ V
158		vex 3476	. . . . . . . . . . . . . 14 ⊢ 𝑎 ∈ V
159		vex 3476	. . . . . . . . . . . . . 14 ⊢ 𝑏 ∈ V
160	156, 157, 158, 159	preq12b 4860	. . . . . . . . . . . . 13 ⊢ ({𝑐, 𝑑} = {𝑎, 𝑏} ↔ ((𝑐 = 𝑎 ∧ 𝑑 = 𝑏) ∨ (𝑐 = 𝑏 ∧ 𝑑 = 𝑎)))
161	155, 160	imbitrrdi 251	. . . . . . . . . . . 12 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → ((inf({𝑐, 𝑑}, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅) ∧ sup({𝑐, 𝑑}, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅)) → {𝑐, 𝑑} = {𝑎, 𝑏}))
162	26, 161	sylbid 239	. . . . . . . . . . 11 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))
163		infeq1 9521	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑍 = {𝑐, 𝑑} → inf(𝑍, 𝑉, 𝑅) = inf({𝑐, 𝑑}, 𝑉, 𝑅))
164		supeq1 9490	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑍 = {𝑐, 𝑑} → sup(𝑍, 𝑉, 𝑅) = sup({𝑐, 𝑑}, 𝑉, 𝑅))
165	163, 164	opeq12d 4890	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑍 = {𝑐, 𝑑} → ⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩)
166		infeq1 9521	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑊 = {𝑎, 𝑏} → inf(𝑊, 𝑉, 𝑅) = inf({𝑎, 𝑏}, 𝑉, 𝑅))
167		supeq1 9490	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑊 = {𝑎, 𝑏} → sup(𝑊, 𝑉, 𝑅) = sup({𝑎, 𝑏}, 𝑉, 𝑅))
168	166, 167	opeq12d 4890	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑊 = {𝑎, 𝑏} → ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩)
169	165, 168	eqeqan12rd 2744	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 = {𝑎, 𝑏} ∧ 𝑍 = {𝑐, 𝑑}) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ ↔ ⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩))
170		eqeq12 2746	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑍 = {𝑐, 𝑑} ∧ 𝑊 = {𝑎, 𝑏}) → (𝑍 = 𝑊 ↔ {𝑐, 𝑑} = {𝑎, 𝑏}))
171	170	ancoms 457	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑊 = {𝑎, 𝑏} ∧ 𝑍 = {𝑐, 𝑑}) → (𝑍 = 𝑊 ↔ {𝑐, 𝑑} = {𝑎, 𝑏}))
172	169, 171	imbi12d 343	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑊 = {𝑎, 𝑏} ∧ 𝑍 = {𝑐, 𝑑}) → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏})))
173	172	ex 411	. . . . . . . . . . . . . . . 16 ⊢ (𝑊 = {𝑎, 𝑏} → (𝑍 = {𝑐, 𝑑} → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))))
174	173	ad2antrl 726	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) → (𝑍 = {𝑐, 𝑑} → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))))
175	174	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → (𝑍 = {𝑐, 𝑑} → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))))
176	175	com12 32	. . . . . . . . . . . . 13 ⊢ (𝑍 = {𝑐, 𝑑} → ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))))
177	176	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏}))))
178	177	impcom 406	. . . . . . . . . . 11 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → ((⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊) ↔ (⟨inf({𝑐, 𝑑}, 𝑉, 𝑅), sup({𝑐, 𝑑}, 𝑉, 𝑅)⟩ = ⟨inf({𝑎, 𝑏}, 𝑉, 𝑅), sup({𝑎, 𝑏}, 𝑉, 𝑅)⟩ → {𝑐, 𝑑} = {𝑎, 𝑏})))
179	162, 178	mpbird 256	. . . . . . . . . 10 ⊢ (((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) ∧ (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑)) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))
180	179	ex 411	. . . . . . . . 9 ⊢ ((((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) ∧ (𝑐 ∈ 𝑉 ∧ 𝑑 ∈ 𝑉)) → ((𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊)))
181	180	rexlimdvva 3206	. . . . . . . 8 ⊢ (((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) ∧ (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏)) → (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊)))
182	181	ex 411	. . . . . . 7 ⊢ ((𝑅 Or 𝑉 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉)) → ((𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏) → (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))))
183	182	rexlimdvva 3206	. . . . . 6 ⊢ (𝑅 Or 𝑉 → (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏) → (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))))
184	183	com13 88	. . . . 5 ⊢ (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (∃𝑎 ∈ 𝑉 ∃𝑏 ∈ 𝑉 (𝑊 = {𝑎, 𝑏} ∧ 𝑎 ≠ 𝑏) → (𝑅 Or 𝑉 → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))))
185	19, 184	biimtrid 241	. . . 4 ⊢ (∃𝑐 ∈ 𝑉 ∃𝑑 ∈ 𝑉 (𝑍 = {𝑐, 𝑑} ∧ 𝑐 ≠ 𝑑) → (𝑊 ∈ 𝑃 → (𝑅 Or 𝑉 → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))))
186	18, 185	sylbi 216	. . 3 ⊢ (𝑍 ∈ 𝑃 → (𝑊 ∈ 𝑃 → (𝑅 Or 𝑉 → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))))
187	186	3imp31 1109	. 2 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → (⟨inf(𝑍, 𝑉, 𝑅), sup(𝑍, 𝑉, 𝑅)⟩ = ⟨inf(𝑊, 𝑉, 𝑅), sup(𝑊, 𝑉, 𝑅)⟩ → 𝑍 = 𝑊))
188	16, 187	sylbid 239	1 ⊢ ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑃 ∧ 𝑍 ∈ 𝑃) → ((𝐹‘𝑍) = (𝐹‘𝑊) → 𝑍 = 𝑊))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 394   ∨ wo 845   ∨ w3o 1083   ∧ w3a 1084   = wceq 1534   ∈ wcel 2100   ≠ wne 2933  ∃wrex 3063  {crab 3428  Vcvv 3472   ∩ cin 3957  ifcif 4534  𝒫 cpw 4608  {cpr 4636  ⟨cop 4640   class class class wbr 5154   ↦ cmpt 5237   Or wor 5595   × cxp 5682  ‘cfv 6557  supcsup 9485  infcinf 9486  2c2 12324  ♯chash 14354

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 2102  ax-9 2110  ax-10 2133  ax-11 2150  ax-12 2170  ax-ext 2700  ax-sep 5305  ax-nul 5312  ax-pow 5371  ax-pr 5435  ax-un 7749  ax-cnex 11216  ax-resscn 11217  ax-1cn 11218  ax-icn 11219  ax-addcl 11220  ax-addrcl 11221  ax-mulcl 11222  ax-mulrcl 11223  ax-mulcom 11224  ax-addass 11225  ax-mulass 11226  ax-distr 11227  ax-i2m1 11228  ax-1ne0 11229  ax-1rid 11230  ax-rnegex 11231  ax-rrecex 11232  ax-cnre 11233  ax-pre-lttri 11234  ax-pre-lttrn 11235  ax-pre-ltadd 11236  ax-pre-mulgt0 11237

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2062  df-mo 2532  df-eu 2561  df-clab 2707  df-cleq 2721  df-clel 2806  df-nfc 2881  df-ne 2934  df-nel 3040  df-ral 3055  df-rex 3064  df-rmo 3373  df-reu 3374  df-rab 3429  df-v 3474  df-sbc 3788  df-csb 3904  df-dif 3961  df-un 3963  df-in 3965  df-ss 3975  df-pss 3978  df-nul 4334  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4917  df-int 4958  df-iun 5006  df-br 5155  df-opab 5217  df-mpt 5238  df-tr 5272  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5639  df-we 5641  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6316  df-ord 6382  df-on 6383  df-lim 6384  df-suc 6385  df-iota 6509  df-fun 6559  df-fn 6560  df-f 6561  df-f1 6562  df-fo 6563  df-f1o 6564  df-fv 6565  df-riota 7384  df-ov 7431  df-oprab 7432  df-mpo 7433  df-om 7883  df-1st 8009  df-2nd 8010  df-frecs 8301  df-wrecs 8332  df-recs 8406  df-rdg 8445  df-1o 8501  df-2o 8502  df-oadd 8505  df-er 8739  df-en 8980  df-dom 8981  df-sdom 8982  df-fin 8983  df-sup 9487  df-inf 9488  df-dju 9946  df-card 9984  df-pnf 11302  df-mnf 11303  df-xr 11304  df-ltxr 11305  df-le 11306  df-sub 11498  df-neg 11499  df-nn 12270  df-2 12332  df-n0 12530  df-z 12616  df-uz 12880  df-fz 13544  df-hash 14355

This theorem is referenced by:  prproropf1o  47193