Theorem ps-1 40737

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 7453	. . . . . 6 ⊢ (𝑅 = 𝑃 → (𝑅 ∨ 𝑆) = (𝑃 ∨ 𝑆))
2	1	breq2d 5118	. . . . 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 40628	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
13	7, 8, 9, 12	syl3anc 1399	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
14	13	3ad2ant1 1151	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑅) = (𝑅 ∨ 𝑃))
15		hllat 40623	. . . . . . . . . . . . . . . 16 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
16	15	3ad2ant1 1151	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat)
17		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐾) = (Base‘𝐾)
18	17, 11	atbase 40549	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾))
19	8, 18	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ∈ (Base‘𝐾))
20		simp22 1226	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ 𝐴)
21	17, 11	atbase 40549	. . . . . . . . . . . . . . . 16 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ (Base‘𝐾))
22	20, 21	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ∈ (Base‘𝐾))
23		simp3r 1221	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ 𝐴)
24	17, 10, 11	hlatjcl 40627	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
25	7, 9, 23, 24	syl3anc 1399	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
26		ps1.l	. . . . . . . . . . . . . . . 16 ⊢ ≤ = (le‘𝐾)
27	17, 26, 10	latjle12 18656	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
28	16, 19, 22, 25, 27	syl13anc 1400	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
29		simpl 488	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ≤ (𝑅 ∨ 𝑆) ∧ 𝑄 ≤ (𝑅 ∨ 𝑆)) → 𝑃 ≤ (𝑅 ∨ 𝑆))
30	28, 29	biimtrrdi 257	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → 𝑃 ≤ (𝑅 ∨ 𝑆)))
31	30	adantr 486	. . . . . . . . . . . 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 490	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → 𝑃 ≠ 𝑅)
37	26, 10, 11	hlatexchb1 40653	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑃 ≠ 𝑅) → (𝑃 ≤ (𝑅 ∨ 𝑆) ↔ (𝑅 ∨ 𝑃) = (𝑅 ∨ 𝑆)))
38	32, 33, 34, 35, 36, 37	syl131anc 1411	. . . . . . . . . . . 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 5137	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅 ∧ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅))
43	42	3expia 1139	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) ∧ 𝑃 ≠ 𝑅) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
44	17, 10, 11	hlatjcl 40627	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
45	7, 8, 9, 44	syl3anc 1399	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))
46	17, 26, 10	latjle12 18656	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑅) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
47	16, 19, 22, 45, 46	syl13anc 1400	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅)))
48		simpr 490	. . . . . . . . . 10 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) → 𝑄 ≤ (𝑃 ∨ 𝑅))
49		simp23 1227	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑃 ≠ 𝑄)
50	49	necomd 3014	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑄 ≠ 𝑃)
51	26, 10, 11	hlatexchb1 40653	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑅) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
52	7, 20, 9, 8, 50, 51	syl131anc 1411	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑅) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
53	48, 52	imbitrid 247	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑅) ∧ 𝑄 ≤ (𝑃 ∨ 𝑅)) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
54	47, 53	sylbird 263	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑅) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑅)))
55	54	adantr 486	. . . . . . 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 40627	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
61	7, 8, 23, 60	syl3anc 1399	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
62	17, 26, 10	latjle12 18656	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
63	16, 19, 22, 61, 62	syl13anc 1400	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
64		simpr 490	. . . . 5 ⊢ ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) → 𝑄 ≤ (𝑃 ∨ 𝑆))
65	63, 64	biimtrrdi 257	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → 𝑄 ≤ (𝑃 ∨ 𝑆)))
66	26, 10, 11	hlatexchb1 40653	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑄 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) ∧ 𝑄 ≠ 𝑃) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
67	7, 20, 23, 8, 50, 66	syl131anc 1411	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑄 ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
68	65, 67	sylibd 242	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
69	5, 59, 68	pm2.61ne 3044	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))
70	17, 10, 11	hlatjcl 40627	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
71	7, 8, 20, 70	syl3anc 1399	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))
72	17, 26	latref 18647	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
73	16, 71, 72	syl2anc 596	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄))
74		breq2 5110	. . 3 ⊢ ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑄) ↔ (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
75	73, 74	syl5ibcom 248	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆) → (𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆)))
76	69, 75	impbid 215	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑅 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑅 ∨ 𝑆)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  lecple 17467  joincjn 18517  Latclat 18637  Atomscatm 40523  HLchlt 40610

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-proset 18500  df-poset 18519  df-plt 18534  df-lub 18550  df-glb 18551  df-join 18552  df-meet 18553  df-p0 18629  df-lat 18638  df-covers 40526  df-ats 40527  df-atl 40558  df-cvlat 40582  df-hlat 40611

This theorem is used by:  2atjlej  40739  hlatexch3N  40740  hlatexch4  40741  2llnjaN  40826  dalem1  40919  lneq2at  41038  2llnma3r  41048  cdleme11c  41521  cdleme11  41530  cdleme35a  41708  cdleme42k  41744  cdlemg8b  41888  cdlemg13a  41911  cdlemg18b  41939  cdlemg42  41989  trljco  42000