Metamath Proof Explorer


Theorem cdlemeda

Description: Part of proof of Lemma E in Crawley p. 113. Utility lemma. D represents s_2. (Contributed by NM, 13-Nov-2012)

Ref Expression
Hypotheses cdlemeda.l ˙=K
cdlemeda.j ˙=joinK
cdlemeda.m ˙=meetK
cdlemeda.a A=AtomsK
cdlemeda.h H=LHypK
cdlemeda.d D=R˙S˙W
Assertion cdlemeda KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QDA

Proof

Step Hyp Ref Expression
1 cdlemeda.l ˙=K
2 cdlemeda.j ˙=joinK
3 cdlemeda.m ˙=meetK
4 cdlemeda.a A=AtomsK
5 cdlemeda.h H=LHypK
6 cdlemeda.d D=R˙S˙W
7 simp1l KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QKHL
8 simp31 KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QRA
9 simp2l KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QSA
10 2 4 hlatjcom KHLRASAR˙S=S˙R
11 7 8 9 10 syl3anc KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QR˙S=S˙R
12 11 oveq1d KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QR˙S˙W=S˙R˙W
13 simp1r KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QWH
14 simp2r KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙Q¬S˙W
15 simp32 KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QR˙P˙Q
16 simp33 KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙Q¬S˙P˙Q
17 1 2 4 5 cdlemesner KHLRASAR˙P˙Q¬S˙P˙QSR
18 7 8 9 15 16 17 syl122anc KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QSR
19 1 2 3 4 5 lhpat KHLWHSA¬S˙WRASRS˙R˙WA
20 7 13 9 14 8 18 19 syl222anc KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QS˙R˙WA
21 12 20 eqeltrd KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QR˙S˙WA
22 6 21 eqeltrid KHLWHSA¬S˙WRAR˙P˙Q¬S˙P˙QDA