Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdlemednuN Structured version   Unicode version

Theorem cdlemednuN 35497
Description: Part of proof of Lemma E in [Crawley] p. 113. Utility lemma.  D represents s2. (Contributed by NM, 18-Nov-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemeda.l  |-  .<_  =  ( le `  K )
cdlemeda.j  |-  .\/  =  ( join `  K )
cdlemeda.m  |-  ./\  =  ( meet `  K )
cdlemeda.a  |-  A  =  ( Atoms `  K )
cdlemeda.h  |-  H  =  ( LHyp `  K
)
cdlemeda.d  |-  D  =  ( ( R  .\/  S )  ./\  W )
cdlemednu.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
Assertion
Ref Expression
cdlemednuN  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  D  =/=  U )

Proof of Theorem cdlemednuN
StepHypRef Expression
1 cdlemeda.l . . 3  |-  .<_  =  ( le `  K )
2 cdlemeda.j . . 3  |-  .\/  =  ( join `  K )
3 cdlemeda.m . . 3  |-  ./\  =  ( meet `  K )
4 cdlemeda.a . . 3  |-  A  =  ( Atoms `  K )
5 cdlemeda.h . . 3  |-  H  =  ( LHyp `  K
)
6 cdlemeda.d . . 3  |-  D  =  ( ( R  .\/  S )  ./\  W )
71, 2, 3, 4, 5, 6cdlemednpq 35496 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  -.  D  .<_  ( P 
.\/  Q ) )
8 simp1l 1020 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  K  e.  HL )
9 simp1r 1021 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  W  e.  H )
10 simp21 1029 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  P  e.  A )
11 simp22 1030 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  Q  e.  A )
12 cdlemednu.u . . . . . 6  |-  U  =  ( ( P  .\/  Q )  ./\  W )
131, 2, 3, 4, 5, 12cdlemeulpq 35417 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A ) )  ->  U  .<_  ( P  .\/  Q ) )
148, 9, 10, 11, 13syl22anc 1229 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  U  .<_  ( P  .\/  Q ) )
15 breq1 4456 . . . 4  |-  ( D  =  U  ->  ( D  .<_  ( P  .\/  Q )  <->  U  .<_  ( P 
.\/  Q ) ) )
1614, 15syl5ibrcom 222 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  -> 
( D  =  U  ->  D  .<_  ( P 
.\/  Q ) ) )
1716necon3bd 2679 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  -> 
( -.  D  .<_  ( P  .\/  Q )  ->  D  =/=  U
) )
187, 17mpd 15 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  ( R  e.  A  /\  -.  R  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q
) ) )  ->  D  =/=  U )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767    =/= wne 2662   class class class wbr 4453   ` cfv 5594  (class class class)co 6295   lecple 14579   joincjn 15448   meetcmee 15449   Atomscatm 34461   HLchlt 34548   LHypclh 35181
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4564  ax-sep 4574  ax-nul 4582  ax-pow 4631  ax-pr 4692  ax-un 6587
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-nul 3791  df-if 3946  df-pw 4018  df-sn 4034  df-pr 4036  df-op 4040  df-uni 4252  df-iun 4333  df-iin 4334  df-br 4454  df-opab 4512  df-mpt 4513  df-id 4801  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-res 5017  df-ima 5018  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6256  df-ov 6298  df-oprab 6299  df-mpt2 6300  df-1st 6795  df-2nd 6796  df-poset 15450  df-plt 15462  df-lub 15478  df-glb 15479  df-join 15480  df-meet 15481  df-p0 15543  df-p1 15544  df-lat 15550  df-clat 15612  df-oposet 34374  df-ol 34376  df-oml 34377  df-covers 34464  df-ats 34465  df-atl 34496  df-cvlat 34520  df-hlat 34549  df-psubsp 34700  df-pmap 34701  df-padd 34993  df-lhyp 35185
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator