Metamath Proof Explorer


Theorem cdleme3fN

Description: Part of proof of Lemma E in Crawley p. 113. Lemma leading to cdleme3fa and cdleme3 . TODO: Delete - duplicates cdleme0e . (Contributed by NM, 6-Jun-2012) (New usage is discouraged.)

Ref Expression
Hypotheses cdleme1.l ˙=K
cdleme1.j ˙=joinK
cdleme1.m ˙=meetK
cdleme1.a A=AtomsK
cdleme1.h H=LHypK
cdleme1.u U=P˙Q˙W
cdleme1.f F=R˙U˙Q˙P˙R˙W
cdleme3.3 V=P˙R˙W
Assertion cdleme3fN KHLWHPA¬P˙WQARA¬R˙WPQ¬R˙P˙QUV

Proof

Step Hyp Ref Expression
1 cdleme1.l ˙=K
2 cdleme1.j ˙=joinK
3 cdleme1.m ˙=meetK
4 cdleme1.a A=AtomsK
5 cdleme1.h H=LHypK
6 cdleme1.u U=P˙Q˙W
7 cdleme1.f F=R˙U˙Q˙P˙R˙W
8 cdleme3.3 V=P˙R˙W
9 1 2 3 4 5 6 8 cdleme0e KHLWHPA¬P˙WQARA¬R˙WPQ¬R˙P˙QUV