Theorem ps-1 40232

Description: The join of two atoms 𝑅 ∨ 𝑆 (specifying a projective geometry line) is determined uniquely by any two atoms (specifying two points) less than or equal to that join. Part of Lemma 16.4 of [MaedaMaeda] p. 69, showing projective space postulate PS1 in [MaedaMaeda] p. 67. (Contributed by NM, 15-Nov-2011.)

Hypotheses

Ref	Expression
ps1.l	⊢ ≤ = (le‘𝐾)
ps1.j	⊢ ∨ = (join‘𝐾)
ps1.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
ps-1	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))

Proof of Theorem ps-1

Step	Hyp	Ref	Expression
1		oveq1 7419	. . . . . 6 ⊢ (𝑅 = 𝑃 → (𝑅 ∨ 𝑆) = (𝑃 ∨ 𝑆))
2	1	breq2d 5122	. . . . 5 ⊢ (𝑅 = 𝑃 → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
3	1	eqeq2d 2774	. . . . 5 ⊢ (𝑅 = 𝑃 → ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
4	2, 3	imbi12d 347	. . . 4 ⊢ (𝑅 = 𝑃 → (((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)) ↔ ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆))))
5	4	eqcoms 2771	. . 3 ⊢ (𝑃 = 𝑅 → (((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)) ↔ ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆))))
6		simp3 1156	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆))
7		simp1 1154	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL)
8		simp21 1225	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
9		simp3l 1220	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ 𝐴)
10		ps1.j	. . . . . . . . . . . . 13 ⊢ ∨ = (join‘𝐾)
11		ps1.a	. . . . . . . . . . . . 13 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11	hlatjcom 40123	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
13	7, 8, 9, 12	syl3anc 1398	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
14	13	3ad2ant1 1151	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
15		hllat 40118	. . . . . . . . . . . . . . . 16 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
16	15	3ad2ant1 1151	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat)
17		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐾) = (Base‘𝐾)
18	17, 11	atbase 40044	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
19	8, 18	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ∈ (Base‘𝐾))
20		simp22 1226	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
21	17, 11	atbase 40044	. . . . . . . . . . . . . . . 16 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
22	20, 21	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ (Base‘𝐾))
23		simp3r 1221	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ 𝐴)
24	17, 10, 11	hlatjcl 40122	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
25	7, 9, 23, 24	syl3anc 1398	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
26		ps1.l	. . . . . . . . . . . . . . . 16 ⊢ ≤ = (le‘𝐾)
27	17, 26, 10	latjle12 18507	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
28	16, 19, 22, 25, 27	syl13anc 1399	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
29		simpl 487	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) → 𝑃 ≤ (𝑅 ∨ 𝑆))
30	28, 29	biimtrrdi 257	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → 𝑃 ≤ (𝑅 ∨ 𝑆)))
31	30	adantr 485	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → 𝑃 ≤ (𝑅 ∨ 𝑆)))
32		simpl1 1210	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝐾 ∈ HL)
33		simpl21 1270	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑃 ∈ 𝐴)
34		simpl3r 1248	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑆 ∈ 𝐴)
35		simpl3l 1247	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑅 ∈ 𝐴)
36		simpr 489	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑃 ≠ 𝑅)
37	26, 10, 11	hlatexchb1 40148	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 ≤ (𝑅 ∨ 𝑆) ↔ (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
38	32, 33, 34, 35, 36, 37	syl131anc 1410	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → (𝑃 ≤ (𝑅 ∨ 𝑆) ↔ (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
39	31, 38	sylibd 242	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
40	39	3impia 1135	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆))
41	14, 40	eqtrd 2798	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑆))
42	6, 41	breqtrrd 5140	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅))
43	42	3expia 1139	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
44	17, 10, 11	hlatjcl 40122	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
45	7, 8, 9, 44	syl3anc 1398	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
46	17, 26, 10	latjle12 18507	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
47	16, 19, 22, 45, 46	syl13anc 1399	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
48		simpr 489	. . . . . . . . . 10 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) → 𝑄 ≤ (𝑃 ∨ 𝑅))
49		simp23 1227	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ≠ 𝑄)
50	49	necomd 3013	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ≠ 𝑃)
51	26, 10, 11	hlatexchb1 40148	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑅) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
52	7, 20, 9, 8, 50, 51	syl131anc 1410	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑅) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
53	48, 52	imbitrid 247	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
54	47, 53	sylbird 263	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
55	54	adantr 485	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
56	43, 55	syld 48	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
57	56	3impia 1135	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))
58	57, 41	eqtrd 2798	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆))
59	58	3expia 1139	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))
60	17, 10, 11	hlatjcl 40122	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
61	7, 8, 23, 60	syl3anc 1398	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
62	17, 26, 10	latjle12 18507	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
63	16, 19, 22, 61, 62	syl13anc 1399	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
64		simpr 489	. . . . 5 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) → 𝑄 ≤ (𝑃 ∨ 𝑆))
65	63, 64	biimtrrdi 257	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → 𝑄 ≤ (𝑃 ∨ 𝑆)))
66	26, 10, 11	hlatexchb1 40148	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
67	7, 20, 23, 8, 50, 66	syl131anc 1410	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
68	65, 67	sylibd 242	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
69	5, 59, 68	pm2.61ne 3043	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))
70	17, 10, 11	hlatjcl 40122	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
71	7, 8, 20, 70	syl3anc 1398	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
72	17, 26	latref 18498	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
73	16, 71, 72	syl2anc 595	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
74		breq2 5114	. . 3 ⊢ ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
75	73, 74	syl5ibcom 248	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
76	69, 75	impbid 215	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958   class class class wbr 5110  ‘cfv 6538  (class class class)co 7412  Basecbs 17270  lecple 17318  joincjn 18368  Latclat 18488  Atomscatm 40018  HLchlt 40105

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-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7369  df-ov 7415  df-oprab 7416  df-proset 18351  df-poset 18370  df-plt 18385  df-lub 18401  df-glb 18402  df-join 18403  df-meet 18404  df-p0 18480  df-lat 18489  df-covers 40021  df-ats 40022  df-atl 40053  df-cvlat 40077  df-hlat 40106

This theorem is referenced by:  2atjlej  40234  hlatexch3N  40235  hlatexch4  40236  2llnjaN  40321  dalem1  40414  lneq2at  40533  2llnma3r  40543  cdleme11c  41016  cdleme11  41025  cdleme35a  41203  cdleme42k  41239  cdlemg8b  41383  cdlemg13a  41406  cdlemg18b  41434  cdlemg42  41484  trljco  41495