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

Theorem cdlemn11b 35192
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 990 . 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 35191 . 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 3466 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 setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    /\ w3a 965    = wceq 1370    e. wcel 1758    C_ wss 3437   <.cop 3992   class class class wbr 4401    |-> cmpt 4459    _I cid 4740    |` cres 4951   ` cfv 5527   iota_crio 6161  (class class class)co 6201   Basecbs 14293   +g cplusg 14358   lecple 14365   occoc 14366   joincjn 15234   LSSumclsm 16255   Atomscatm 33247   HLchlt 33334   LHypclh 33967   LTrncltrn 34084   trLctrl 34141   TEndoctendo 34735   DVecHcdvh 35062   DIsoBcdib 35122   DIsoCcdic 35156
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-rep 4512  ax-sep 4522  ax-nul 4530  ax-pow 4579  ax-pr 4640  ax-un 6483  ax-riotaBAD 32943
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-nel 2651  df-ral 2804  df-rex 2805  df-reu 2806  df-rmo 2807  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3397  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-nul 3747  df-if 3901  df-pw 3971  df-sn 3987  df-pr 3989  df-op 3993  df-uni 4201  df-iun 4282  df-iin 4283  df-br 4402  df-opab 4460  df-mpt 4461  df-id 4745  df-xp 4955  df-rel 4956  df-cnv 4957  df-co 4958  df-dm 4959  df-rn 4960  df-res 4961  df-ima 4962  df-iota 5490  df-fun 5529  df-fn 5530  df-f 5531  df-f1 5532  df-fo 5533  df-f1o 5534  df-fv 5535  df-riota 6162  df-ov 6204  df-oprab 6205  df-mpt2 6206  df-1st 6688  df-2nd 6689  df-undef 6903  df-map 7327  df-poset 15236  df-plt 15248  df-lub 15264  df-glb 15265  df-join 15266  df-meet 15267  df-p0 15329  df-p1 15330  df-lat 15336  df-clat 15398  df-oposet 33160  df-ol 33162  df-oml 33163  df-covers 33250  df-ats 33251  df-atl 33282  df-cvlat 33306  df-hlat 33335  df-llines 33481  df-lplanes 33482  df-lvols 33483  df-lines 33484  df-psubsp 33486  df-pmap 33487  df-padd 33779  df-lhyp 33971  df-laut 33972  df-ldil 34087  df-ltrn 34088  df-trl 34142  df-tendo 34738  df-dic 35157
This theorem is referenced by:  cdlemn11c  35193
  Copyright terms: Public domain W3C validator