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

Theorem cdlemn11b 30528
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 30527 . 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 3123 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 3094   <.cop 3584   class class class wbr 3963    e. cmpt 4017    _I cid 4241    |` cres 4628   ` cfv 4638  (class class class)co 5757   iota_crio 6228   Basecbs 13075   +g cplusg 13135   lecple 13142   occoc 13143   joincjn 14005   LSSumclsm 14872   Atomscatm 28583   HLchlt 28670   LHypclh 29303   LTrncltrn 29420   trLctrl 29477   TEndoctendo 30071   DVecHcdvh 30398   DIsoBcdib 30458   DIsoCcdic 30492
This theorem is referenced by:  cdlemn11c  30529
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 4071  ax-sep 4081  ax-nul 4089  ax-pow 4126  ax-pr 4152  ax-un 4449
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 2520  df-rex 2521  df-reu 2522  df-rab 2523  df-v 2742  df-sbc 2936  df-csb 3024  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-pw 3568  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-iun 3848  df-iin 3849  df-br 3964  df-opab 4018  df-mpt 4019  df-id 4246  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-f1 4651  df-fo 4652  df-f1o 4653  df-fv 4654  df-ov 5760  df-oprab 5761  df-mpt2 5762  df-1st 6021  df-2nd 6022  df-iota 6190  df-undef 6229  df-riota 6237  df-map 6707  df-poset 14007  df-plt 14019  df-lub 14035  df-glb 14036  df-join 14037  df-meet 14038  df-p0 14072  df-p1 14073  df-lat 14079  df-clat 14141  df-oposet 28496  df-ol 28498  df-oml 28499  df-covers 28586  df-ats 28587  df-atl 28618  df-cvlat 28642  df-hlat 28671  df-llines 28817  df-lplanes 28818  df-lvols 28819  df-lines 28820  df-psubsp 28822  df-pmap 28823  df-padd 29115  df-lhyp 29307  df-laut 29308  df-ldil 29423  df-ltrn 29424  df-trl 29478  df-tendo 30074  df-dic 30493
  Copyright terms: Public domain W3C validator