Theorem cdleme19a 40600

Description: Part of proof of Lemma E in [Crawley] p. 113, 5th paragraph on p. 114, 1st line. 𝐷 represents s₂. In their notation, we prove that if r ≤ s ∨ t, then s₂₌(s ∨ t) ∧ w. (Contributed by NM, 13-Nov-2012.)

Hypotheses

Ref	Expression
cdleme19.l	⊢ ≤ = (le‘𝐾)
cdleme19.j	⊢ ∨ = (join‘𝐾)
cdleme19.m	⊢ ∧ = (meet‘𝐾)
cdleme19.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme19.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme19.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme19.f	⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊)))
cdleme19.g	⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊)))
cdleme19.d	⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊)
cdleme19.y	⊢ 𝑌 = ((𝑅 ∨ 𝑇) ∧ 𝑊)

Assertion

Ref	Expression
cdleme19a	⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝐷 = ((𝑆 ∨ 𝑇) ∧ 𝑊))

Proof of Theorem cdleme19a

Step	Hyp	Ref	Expression
1		cdleme19.d	. 2 ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊)
2		eqid 2737	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
3		cdleme19.l	. . . 4 ⊢ ≤ = (le‘𝐾)
4		hllat 39660	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
5	4	3ad2ant1 1134	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝐾 ∈ Lat)
6		simp1 1137	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝐾 ∈ HL)
7		simp21 1208	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑅 ∈ 𝐴)
8		simp22 1209	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ∈ 𝐴)
9		cdleme19.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
10		cdleme19.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
11	2, 9, 10	hlatjcl 39664	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
12	6, 7, 8, 11	syl3anc 1374	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))
13		simp23 1210	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑇 ∈ 𝐴)
14	2, 9, 10	hlatjcl 39664	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → (𝑆 ∨ 𝑇) ∈ (Base‘𝐾))
15	6, 8, 13, 14	syl3anc 1374	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑆 ∨ 𝑇) ∈ (Base‘𝐾))
16		simp33 1213	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑅 ≤ (𝑆 ∨ 𝑇))
17	3, 9, 10	hlatlej1 39672	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → 𝑆 ≤ (𝑆 ∨ 𝑇))
18	6, 8, 13, 17	syl3anc 1374	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ≤ (𝑆 ∨ 𝑇))
19	2, 10	atbase 39586	. . . . . . 7 ⊢ (𝑅 ∈ 𝐴 → 𝑅 ∈ (Base‘𝐾))
20	7, 19	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑅 ∈ (Base‘𝐾))
21	2, 10	atbase 39586	. . . . . . 7 ⊢ (𝑆 ∈ 𝐴 → 𝑆 ∈ (Base‘𝐾))
22	8, 21	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ∈ (Base‘𝐾))
23	2, 3, 9	latjle12 18377	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑅 ∈ (Base‘𝐾) ∧ 𝑆 ∈ (Base‘𝐾) ∧ (𝑆 ∨ 𝑇) ∈ (Base‘𝐾))) → ((𝑅 ≤ (𝑆 ∨ 𝑇) ∧ 𝑆 ≤ (𝑆 ∨ 𝑇)) ↔ (𝑅 ∨ 𝑆) ≤ (𝑆 ∨ 𝑇)))
24	5, 20, 22, 15, 23	syl13anc 1375	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → ((𝑅 ≤ (𝑆 ∨ 𝑇) ∧ 𝑆 ≤ (𝑆 ∨ 𝑇)) ↔ (𝑅 ∨ 𝑆) ≤ (𝑆 ∨ 𝑇)))
25	16, 18, 24	mpbi2and 713	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑅 ∨ 𝑆) ≤ (𝑆 ∨ 𝑇))
26	3, 9, 10	hlatlej2 39673	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → 𝑆 ≤ (𝑅 ∨ 𝑆))
27	6, 7, 8, 26	syl3anc 1374	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑆 ≤ (𝑅 ∨ 𝑆))
28		hlcvl 39656	. . . . . . . . 9 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat)
29	28	3ad2ant1 1134	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝐾 ∈ CvLat)
30		simp31 1211	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑅 ≤ (𝑃 ∨ 𝑄))
31		simp32 1212	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))
32		nbrne2 5119	. . . . . . . . 9 ⊢ ((𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝑅 ≠ 𝑆)
33	30, 31, 32	syl2anc 585	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑅 ≠ 𝑆)
34	3, 9, 10	cvlatexch1 39633	. . . . . . . 8 ⊢ ((𝐾 ∈ CvLat ∧ (𝑅 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ 𝑅 ≠ 𝑆) → (𝑅 ≤ (𝑆 ∨ 𝑇) → 𝑇 ≤ (𝑆 ∨ 𝑅)))
35	29, 7, 13, 8, 33, 34	syl131anc 1386	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑅 ≤ (𝑆 ∨ 𝑇) → 𝑇 ≤ (𝑆 ∨ 𝑅)))
36	16, 35	mpd 15	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑇 ≤ (𝑆 ∨ 𝑅))
37	9, 10	hlatjcom 39665	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) = (𝑆 ∨ 𝑅))
38	6, 7, 8, 37	syl3anc 1374	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑅 ∨ 𝑆) = (𝑆 ∨ 𝑅))
39	36, 38	breqtrrd 5127	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑇 ≤ (𝑅 ∨ 𝑆))
40	2, 10	atbase 39586	. . . . . . 7 ⊢ (𝑇 ∈ 𝐴 → 𝑇 ∈ (Base‘𝐾))
41	13, 40	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝑇 ∈ (Base‘𝐾))
42	2, 3, 9	latjle12 18377	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑆 ∈ (Base‘𝐾) ∧ 𝑇 ∈ (Base‘𝐾) ∧ (𝑅 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑆 ≤ (𝑅 ∨ 𝑆) ∧ 𝑇 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑆 ∨ 𝑇) ≤ (𝑅 ∨ 𝑆)))
43	5, 22, 41, 12, 42	syl13anc 1375	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ≤ (𝑅 ∨ 𝑆) ∧ 𝑇 ≤ (𝑅 ∨ 𝑆)) ↔ (𝑆 ∨ 𝑇) ≤ (𝑅 ∨ 𝑆)))
44	27, 39, 43	mpbi2and 713	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑆 ∨ 𝑇) ≤ (𝑅 ∨ 𝑆))
45	2, 3, 5, 12, 15, 25, 44	latasymd 18372	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → (𝑅 ∨ 𝑆) = (𝑆 ∨ 𝑇))
46	45	oveq1d 7375	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → ((𝑅 ∨ 𝑆) ∧ 𝑊) = ((𝑆 ∨ 𝑇) ∧ 𝑊))
47	1, 46	eqtrid 2784	1 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≤ (𝑆 ∨ 𝑇))) → 𝐷 = ((𝑆 ∨ 𝑇) ∧ 𝑊))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933   class class class wbr 5099  ‘cfv 6493  (class class class)co 7360  Basecbs 17140  lecple 17188  joincjn 18238  meetcmee 18239  Latclat 18358  Atomscatm 39560  CvLatclc 39562  HLchlt 39647  LHypclh 40281

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-proset 18221  df-poset 18240  df-plt 18255  df-lub 18271  df-glb 18272  df-join 18273  df-meet 18274  df-p0 18350  df-lat 18359  df-covers 39563  df-ats 39564  df-atl 39595  df-cvlat 39619  df-hlat 39648

This theorem is referenced by:  cdleme19b  40601