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

Theorem cdleme21a 31136
Description: Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 28-Nov-2012.)
Hypotheses
Ref Expression
cdleme21a.l  |-  .<_  =  ( le `  K )
cdleme21a.j  |-  .\/  =  ( join `  K )
cdleme21a.a  |-  A  =  ( Atoms `  K )
Assertion
Ref Expression
cdleme21a  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  S  =/=  z )

Proof of Theorem cdleme21a
StepHypRef Expression
1 simp11 985 . . 3  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  K  e.  HL )
2 hlcvl 30171 . . 3  |-  ( K  e.  HL  ->  K  e.  CvLat )
31, 2syl 15 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  K  e.  CvLat )
4 simp12 986 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  P  e.  A )
5 simp2l 981 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  S  e.  A )
6 simp3l 983 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  -> 
z  e.  A )
7 simp13 987 . . 3  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  Q  e.  A )
8 simp2r 982 . . 3  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  -.  S  .<_  ( P 
.\/  Q ) )
9 cdleme21a.l . . . . 5  |-  .<_  =  ( le `  K )
10 cdleme21a.j . . . . 5  |-  .\/  =  ( join `  K )
11 cdleme21a.a . . . . 5  |-  A  =  ( Atoms `  K )
129, 10, 11atnlej1 30190 . . . 4  |-  ( ( K  e.  HL  /\  ( S  e.  A  /\  P  e.  A  /\  Q  e.  A
)  /\  -.  S  .<_  ( P  .\/  Q
) )  ->  S  =/=  P )
1312necomd 2542 . . 3  |-  ( ( K  e.  HL  /\  ( S  e.  A  /\  P  e.  A  /\  Q  e.  A
)  /\  -.  S  .<_  ( P  .\/  Q
) )  ->  P  =/=  S )
141, 5, 4, 7, 8, 13syl131anc 1195 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  P  =/=  S )
15 simp3r 984 . 2  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  -> 
( P  .\/  z
)  =  ( S 
.\/  z ) )
1611, 10cvlsupr6 30159 . . 3  |-  ( ( K  e.  CvLat  /\  ( P  e.  A  /\  S  e.  A  /\  z  e.  A )  /\  ( P  =/=  S  /\  ( P  .\/  z
)  =  ( S 
.\/  z ) ) )  ->  z  =/=  S )
1716necomd 2542 . 2  |-  ( ( K  e.  CvLat  /\  ( P  e.  A  /\  S  e.  A  /\  z  e.  A )  /\  ( P  =/=  S  /\  ( P  .\/  z
)  =  ( S 
.\/  z ) ) )  ->  S  =/=  z )
183, 4, 5, 6, 14, 15, 17syl132anc 1200 1  |-  ( ( ( K  e.  HL  /\  P  e.  A  /\  Q  e.  A )  /\  ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  /\  ( z  e.  A  /\  ( P 
.\/  z )  =  ( S  .\/  z
) ) )  ->  S  =/=  z )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    =/= wne 2459   class class class wbr 4039   ` cfv 5271  (class class class)co 5874   lecple 13231   joincjn 14094   Atomscatm 30075   CvLatclc 30077   HLchlt 30162
This theorem is referenced by:  cdleme21ct  31140  cdleme21d  31141
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-nel 2462  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-undef 6314  df-riota 6320  df-poset 14096  df-plt 14108  df-lub 14124  df-join 14126  df-lat 14168  df-covers 30078  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163
  Copyright terms: Public domain W3C validator