Theorem ps-1 40108

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 7407	. . . . . 6 ⊢ (𝑅 = 𝑃 → (𝑅 ∨ 𝑆) = (𝑃 ∨ 𝑆))
2	1	breq2d 5116	. . . . 5 ⊢ (𝑅 = 𝑃 → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
3	1	eqeq2d 2776	. . . . 5 ⊢ (𝑅 = 𝑃 → ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
4	2, 3	imbi12d 347	. . . 4 ⊢ (𝑅 = 𝑃 → (((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)) ↔ ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆))))
5	4	eqcoms 2773	. . 3 ⊢ (𝑃 = 𝑅 → (((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)) ↔ ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆))))
6		simp3 1154	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆))
7		simp1 1152	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL)
8		simp21 1223	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ∈ 𝐴)
9		simp3l 1218	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ 𝐴)
10		ps1.j	. . . . . . . . . . . . 13 ⊢ ∨ = (join‘𝐾)
11		ps1.a	. . . . . . . . . . . . 13 ⊢ 𝐴 = (Atoms‘𝐾)
12	10, 11	hlatjcom 39999	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
13	7, 8, 9, 12	syl3anc 1394	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
14	13	3ad2ant1 1149	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
15		hllat 39994	. . . . . . . . . . . . . . . 16 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
16	15	3ad2ant1 1149	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat)
17		eqid 2765	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐾) = (Base‘𝐾)
18	17, 11	atbase 39920	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
19	8, 18	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ∈ (Base‘𝐾))
20		simp22 1224	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
21	17, 11	atbase 39920	. . . . . . . . . . . . . . . 16 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
22	20, 21	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ (Base‘𝐾))
23		simp3r 1219	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ 𝐴)
24	17, 10, 11	hlatjcl 39998	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
25	7, 9, 23, 24	syl3anc 1394	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
26		ps1.l	. . . . . . . . . . . . . . . 16 ⊢ ≤ = (le‘𝐾)
27	17, 26, 10	latjle12 18494	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
28	16, 19, 22, 25, 27	syl13anc 1395	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
29		simpl 487	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) → 𝑃 ≤ (𝑅 ∨ 𝑆))
30	28, 29	biimtrrdi 257	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → 𝑃 ≤ (𝑅 ∨ 𝑆)))
31	30	adantr 485	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → 𝑃 ≤ (𝑅 ∨ 𝑆)))
32		simpl1 1208	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝐾 ∈ HL)
33		simpl21 1268	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑃 ∈ 𝐴)
34		simpl3r 1246	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑆 ∈ 𝐴)
35		simpl3l 1245	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑅 ∈ 𝐴)
36		simpr 489	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑃 ≠ 𝑅)
37	26, 10, 11	hlatexchb1 40024	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 ≤ (𝑅 ∨ 𝑆) ↔ (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
38	32, 33, 34, 35, 36, 37	syl131anc 1406	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → (𝑃 ≤ (𝑅 ∨ 𝑆) ↔ (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
39	31, 38	sylibd 242	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
40	39	3impia 1133	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆))
41	14, 40	eqtrd 2800	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑆))
42	6, 41	breqtrrd 5132	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅))
43	42	3expia 1137	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
44	17, 10, 11	hlatjcl 39998	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
45	7, 8, 9, 44	syl3anc 1394	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
46	17, 26, 10	latjle12 18494	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
47	16, 19, 22, 45, 46	syl13anc 1395	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
48		simpr 489	. . . . . . . . . 10 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) → 𝑄 ≤ (𝑃 ∨ 𝑅))
49		simp23 1225	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ≠ 𝑄)
50	49	necomd 3015	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ≠ 𝑃)
51	26, 10, 11	hlatexchb1 40024	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑅) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
52	7, 20, 9, 8, 50, 51	syl131anc 1406	. . . . . . . . . 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 1133	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅))
58	57, 41	eqtrd 2800	. . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆))
59	58	3expia 1137	. . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))
60	17, 10, 11	hlatjcl 39998	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
61	7, 8, 23, 60	syl3anc 1394	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
62	17, 26, 10	latjle12 18494	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
63	16, 19, 22, 61, 62	syl13anc 1395	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
64		simpr 489	. . . . 5 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) → 𝑄 ≤ (𝑃 ∨ 𝑆))
65	63, 64	biimtrrdi 257	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → 𝑄 ≤ (𝑃 ∨ 𝑆)))
66	26, 10, 11	hlatexchb1 40024	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
67	7, 20, 23, 8, 50, 66	syl131anc 1406	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
68	65, 67	sylibd 242	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
69	5, 59, 68	pm2.61ne 3045	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))
70	17, 10, 11	hlatjcl 39998	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
71	7, 8, 20, 70	syl3anc 1394	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
72	17, 26	latref 18485	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
73	16, 71, 72	syl2anc 595	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
74		breq2 5108	. . 3 ⊢ ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
75	73, 74	syl5ibcom 248	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
76	69, 75	impbid 215	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145   ≠ wne 2960   class class class wbr 5104  ‘cfv 6525  (class class class)co 7400  Basecbs 17257  lecple 17305  joincjn 18355  Latclat 18475  Atomscatm 39894  HLchlt 39981

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-proset 18338  df-poset 18357  df-plt 18372  df-lub 18388  df-glb 18389  df-join 18390  df-meet 18391  df-p0 18467  df-lat 18476  df-covers 39897  df-ats 39898  df-atl 39929  df-cvlat 39953  df-hlat 39982

This theorem is referenced by:  2atjlej  40110  hlatexch3N  40111  hlatexch4  40112  2llnjaN  40197  dalem1  40290  lneq2at  40409  2llnma3r  40419  cdleme11c  40892  cdleme11  40901  cdleme35a  41079  cdleme42k  41115  cdlemg8b  41259  cdlemg13a  41282  cdlemg18b  41310  cdlemg42  41360  trljco  41371