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

Theorem cdlemn11b 32020
Description: Part of proof of Lemma N of [Crawley] p. 121 line 37. (Contributed by NM, 27-Feb-2014.)
Hypotheses
Ref Expression
cdlemn11a.b  |-  B  =  ( Base `  K
)
cdlemn11a.l  |-  .<_  =  ( le `  K )
cdlemn11a.j  |-  .\/  =  ( join `  K )
cdlemn11a.a  |-  A  =  ( Atoms `  K )
cdlemn11a.h  |-  H  =  ( LHyp `  K
)
cdlemn11a.p  |-  P  =  ( ( oc `  K ) `  W
)
cdlemn11a.o  |-  O  =  ( h  e.  T  |->  (  _I  |`  B ) )
cdlemn11a.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemn11a.r  |-  R  =  ( ( trL `  K
) `  W )
cdlemn11a.e  |-  E  =  ( ( TEndo `  K
) `  W )
cdlemn11a.i  |-  I  =  ( ( DIsoB `  K
) `  W )
cdlemn11a.J  |-  J  =  ( ( DIsoC `  K
) `  W )
cdlemn11a.u  |-  U  =  ( ( DVecH `  K
) `  W )
cdlemn11a.d  |-  .+  =  ( +g  `  U )
cdlemn11a.s  |-  .(+)  =  (
LSSum `  U )
cdlemn11a.f  |-  F  =  ( iota_ h  e.  T
( h `  P
)  =  Q )
cdlemn11a.g  |-  G  =  ( iota_ h  e.  T
( h `  P
)  =  N )
Assertion
Ref Expression
cdlemn11b  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( Q  e.  A  /\  -.  Q  .<_  W )  /\  ( N  e.  A  /\  -.  N  .<_  W )  /\  ( X  e.  B  /\  X  .<_  W ) )  /\  ( J `  N )  C_  ( ( J `  Q )  .(+)  ( I `
 X ) ) )  ->  <. G , 
(  _I  |`  T )
>.  e.  ( ( J `
 Q )  .(+)  ( I `  X ) ) )
Distinct variable groups:    .<_ , h    A, h    B, h    h, H   
h, K    h, N    P, h    Q, h    T, h   
h, W
Allowed substitution hints:    .+ ( h)    .(+) ( h)    R( h)    U( h)    E( h)    F( h)    G( h)    I( h)    J( h)    .\/ ( h)    O( h)    X( h)

Proof of Theorem cdlemn11b
StepHypRef Expression
1 simp3 957 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( Q  e.  A  /\  -.  Q  .<_  W )  /\  ( N  e.  A  /\  -.  N  .<_  W )  /\  ( X  e.  B  /\  X  .<_  W ) )  /\  ( J `  N )  C_  ( ( J `  Q )  .(+)  ( I `
 X ) ) )  ->  ( J `  N )  C_  (
( J `  Q
)  .(+)  ( I `  X ) ) )
2 cdlemn11a.b . . 3  |-  B  =  ( Base `  K
)
3 cdlemn11a.l . . 3  |-  .<_  =  ( le `  K )
4 cdlemn11a.j . . 3  |-  .\/  =  ( join `  K )
5 cdlemn11a.a . . 3  |-  A  =  ( Atoms `  K )
6 cdlemn11a.h . . 3  |-  H  =  ( LHyp `  K
)
7 cdlemn11a.p . . 3  |-  P  =  ( ( oc `  K ) `  W
)
8 cdlemn11a.o . . 3  |-  O  =  ( h  e.  T  |->  (  _I  |`  B ) )
9 cdlemn11a.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
10 cdlemn11a.r . . 3  |-  R  =  ( ( trL `  K
) `  W )
11 cdlemn11a.e . . 3  |-  E  =  ( ( TEndo `  K
) `  W )
12 cdlemn11a.i . . 3  |-  I  =  ( ( DIsoB `  K
) `  W )
13 cdlemn11a.J . . 3  |-  J  =  ( ( DIsoC `  K
) `  W )
14 cdlemn11a.u . . 3  |-  U  =  ( ( DVecH `  K
) `  W )
15 cdlemn11a.d . . 3  |-  .+  =  ( +g  `  U )
16 cdlemn11a.s . . 3  |-  .(+)  =  (
LSSum `  U )
17 cdlemn11a.f . . 3  |-  F  =  ( iota_ h  e.  T
( h `  P
)  =  Q )
18 cdlemn11a.g . . 3  |-  G  =  ( iota_ h  e.  T
( h `  P
)  =  N )
192, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18cdlemn11a 32019 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( Q  e.  A  /\  -.  Q  .<_  W )  /\  ( N  e.  A  /\  -.  N  .<_  W )  /\  ( X  e.  B  /\  X  .<_  W ) )  /\  ( J `  N )  C_  ( ( J `  Q )  .(+)  ( I `
 X ) ) )  ->  <. G , 
(  _I  |`  T )
>.  e.  ( J `  N ) )
201, 19sseldd 3194 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( Q  e.  A  /\  -.  Q  .<_  W )  /\  ( N  e.  A  /\  -.  N  .<_  W )  /\  ( X  e.  B  /\  X  .<_  W ) )  /\  ( J `  N )  C_  ( ( J `  Q )  .(+)  ( I `
 X ) ) )  ->  <. G , 
(  _I  |`  T )
>.  e.  ( ( J `
 Q )  .(+)  ( I `  X ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    C_ wss 3165   <.cop 3656   class class class wbr 4039    e. cmpt 4093    _I cid 4320    |` cres 4707   ` cfv 5271  (class class class)co 5874   iota_crio 6313   Basecbs 13164   +g cplusg 13224   lecple 13231   occoc 13232   joincjn 14094   LSSumclsm 14961   Atomscatm 30075   HLchlt 30162   LHypclh 30795   LTrncltrn 30912   trLctrl 30969   TEndoctendo 31563   DVecHcdvh 31890   DIsoBcdib 31950   DIsoCcdic 31984
This theorem is referenced by:  cdlemn11c  32021
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-3or 935  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-rmo 2564  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-iin 3924  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-map 6790  df-poset 14096  df-plt 14108  df-lub 14124  df-glb 14125  df-join 14126  df-meet 14127  df-p0 14161  df-p1 14162  df-lat 14168  df-clat 14230  df-oposet 29988  df-ol 29990  df-oml 29991  df-covers 30078  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163  df-llines 30309  df-lplanes 30310  df-lvols 30311  df-lines 30312  df-psubsp 30314  df-pmap 30315  df-padd 30607  df-lhyp 30799  df-laut 30800  df-ldil 30915  df-ltrn 30916  df-trl 30970  df-tendo 31566  df-dic 31985
  Copyright terms: Public domain W3C validator