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

Theorem cdlemefr27cl 31214
Description: Part of proof of Lemma E in [Crawley] p. 113. Closure of  N. (Contributed by NM, 23-Mar-2013.)
Hypotheses
Ref Expression
cdlemefr27.b  |-  B  =  ( Base `  K
)
cdlemefr27.l  |-  .<_  =  ( le `  K )
cdlemefr27.j  |-  .\/  =  ( join `  K )
cdlemefr27.m  |-  ./\  =  ( meet `  K )
cdlemefr27.a  |-  A  =  ( Atoms `  K )
cdlemefr27.h  |-  H  =  ( LHyp `  K
)
cdlemefr27.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdlemefr27.c  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
cdlemefr27.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
Assertion
Ref Expression
cdlemefr27cl  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  N  e.  B
)

Proof of Theorem cdlemefr27cl
StepHypRef Expression
1 cdlemefr27.n . . 3  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
2 simpr2 962 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  -.  s  .<_  ( P  .\/  Q ) )
3 iffalse 3585 . . . 4  |-  ( -.  s  .<_  ( P  .\/  Q )  ->  if ( s  .<_  ( P 
.\/  Q ) ,  I ,  C )  =  C )
42, 3syl 15 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  if ( s 
.<_  ( P  .\/  Q
) ,  I ,  C )  =  C )
51, 4syl5eq 2340 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  N  =  C )
6 simpl1l 1006 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  K  e.  HL )
7 simpl1r 1007 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  W  e.  H
)
8 simpl2 959 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  P  e.  A
)
9 simpl3 960 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  Q  e.  A
)
10 simpr1 961 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  s  e.  A
)
11 cdlemefr27.l . . . 4  |-  .<_  =  ( le `  K )
12 cdlemefr27.j . . . 4  |-  .\/  =  ( join `  K )
13 cdlemefr27.m . . . 4  |-  ./\  =  ( meet `  K )
14 cdlemefr27.a . . . 4  |-  A  =  ( Atoms `  K )
15 cdlemefr27.h . . . 4  |-  H  =  ( LHyp `  K
)
16 cdlemefr27.u . . . 4  |-  U  =  ( ( P  .\/  Q )  ./\  W )
17 cdlemefr27.c . . . 4  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
18 cdlemefr27.b . . . 4  |-  B  =  ( Base `  K
)
1911, 12, 13, 14, 15, 16, 17, 18cdleme1b 31037 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  Q  e.  A  /\  s  e.  A ) )  ->  C  e.  B )
206, 7, 8, 9, 10, 19syl23anc 1189 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  C  e.  B
)
215, 20eqeltrd 2370 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  P  e.  A  /\  Q  e.  A )  /\  (
s  e.  A  /\  -.  s  .<_  ( P 
.\/  Q )  /\  P  =/=  Q ) )  ->  N  e.  B
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    =/= wne 2459   ifcif 3578   class class class wbr 4039   ` cfv 5271  (class class class)co 5874   Basecbs 13164   lecple 13231   joincjn 14094   meetcmee 14095   Atomscatm 30075   HLchlt 30162   LHypclh 30795
This theorem is referenced by:  cdlemefr29bpre0N  31217  cdlemefr29clN  31218  cdlemefr32fvaN  31220  cdlemefr32fva1  31221
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-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230
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-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  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-iota 5235  df-fun 5273  df-fv 5279  df-ov 5877  df-lat 14168  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163  df-lhyp 30799
  Copyright terms: Public domain W3C validator