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

Theorem cdlemn11b 30549
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 962 . 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 30548 . 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 3142 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 5    -> wi 6    /\ wa 360    /\ w3a 939    = wceq 1619    e. wcel 1621    C_ wss 3113   <.cop 3603   class class class wbr 3983    e. cmpt 4037    _I cid 4262    |` cres 4649   ` cfv 4659  (class class class)co 5778   iota_crio 6249   Basecbs 13096   +g cplusg 13156   lecple 13163   occoc 13164   joincjn 14026   LSSumclsm 14893   Atomscatm 28604   HLchlt 28691   LHypclh 29324   LTrncltrn 29441   trLctrl 29498   TEndoctendo 30092   DVecHcdvh 30419   DIsoBcdib 30479   DIsoCcdic 30513
This theorem is referenced by:  cdlemn11c  30550
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237  ax-rep 4091  ax-sep 4101  ax-nul 4109  ax-pow 4146  ax-pr 4172  ax-un 4470
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-nel 2422  df-ral 2521  df-rex 2522  df-reu 2523  df-rmo 2524  df-rab 2525  df-v 2759  df-sbc 2953  df-csb 3043  df-dif 3116  df-un 3118  df-in 3120  df-ss 3127  df-nul 3417  df-if 3526  df-pw 3587  df-sn 3606  df-pr 3607  df-op 3609  df-uni 3788  df-iun 3867  df-iin 3868  df-br 3984  df-opab 4038  df-mpt 4039  df-id 4267  df-xp 4661  df-rel 4662  df-cnv 4663  df-co 4664  df-dm 4665  df-rn 4666  df-res 4667  df-ima 4668  df-fun 4669  df-fn 4670  df-f 4671  df-f1 4672  df-fo 4673  df-f1o 4674  df-fv 4675  df-ov 5781  df-oprab 5782  df-mpt2 5783  df-1st 6042  df-2nd 6043  df-iota 6211  df-undef 6250  df-riota 6258  df-map 6728  df-poset 14028  df-plt 14040  df-lub 14056  df-glb 14057  df-join 14058  df-meet 14059  df-p0 14093  df-p1 14094  df-lat 14100  df-clat 14162  df-oposet 28517  df-ol 28519  df-oml 28520  df-covers 28607  df-ats 28608  df-atl 28639  df-cvlat 28663  df-hlat 28692  df-llines 28838  df-lplanes 28839  df-lvols 28840  df-lines 28841  df-psubsp 28843  df-pmap 28844  df-padd 29136  df-lhyp 29328  df-laut 29329  df-ldil 29444  df-ltrn 29445  df-trl 29499  df-tendo 30095  df-dic 30514
  Copyright terms: Public domain W3C validator