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

Theorem cdlemkuvN 37042
Description: Part of proof of Lemma K of [Crawley] p. 118. Value of the sigma1 (p) function  U. (Contributed by NM, 2-Jul-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemk1.b  |-  B  =  ( Base `  K
)
cdlemk1.l  |-  .<_  =  ( le `  K )
cdlemk1.j  |-  .\/  =  ( join `  K )
cdlemk1.m  |-  ./\  =  ( meet `  K )
cdlemk1.a  |-  A  =  ( Atoms `  K )
cdlemk1.h  |-  H  =  ( LHyp `  K
)
cdlemk1.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemk1.r  |-  R  =  ( ( trL `  K
) `  W )
cdlemk1.s  |-  S  =  ( f  e.  T  |->  ( iota_ i  e.  T  ( i `  P
)  =  ( ( P  .\/  ( R `
 f ) ) 
./\  ( ( N `
 P )  .\/  ( R `  ( f  o.  `' F ) ) ) ) ) )
cdlemk1.o  |-  O  =  ( S `  D
)
cdlemk1.u  |-  U  =  ( e  e.  T  |->  ( iota_ j  e.  T  ( j `  P
)  =  ( ( P  .\/  ( R `
 e ) ) 
./\  ( ( O `
 P )  .\/  ( R `  ( e  o.  `' D ) ) ) ) ) )
Assertion
Ref Expression
cdlemkuvN  |-  ( G  e.  T  ->  ( U `  G )  =  ( iota_ j  e.  T  ( j `  P )  =  ( ( P  .\/  ( R `  G )
)  ./\  ( ( O `  P )  .\/  ( R `  ( G  o.  `' D
) ) ) ) ) )
Distinct variable groups:    f, i,  ./\    .<_ , i    .\/ , f, i    A, i    D, f, i    f, F, i    i, H    i, K    f, N, i    P, f, i    R, f, i    T, f, i    f, W, i    ./\ , e    .\/ , e    D, e    e, j, G    e, O    P, e    R, e    T, e    e, W
Allowed substitution hints:    A( e, f, j)    B( e, f, i, j)    D( j)    P( j)    R( j)    S( e, f, i, j)    T( j)    U( e, f, i, j)    F( e, j)    G( f, i)    H( e, f, j)    .\/ ( j)    K( e, f, j)    .<_ ( e, f, j)    ./\ ( j)    N( e, j)    O( f, i, j)    W( j)

Proof of Theorem cdlemkuvN
StepHypRef Expression
1 cdlemk1.b . 2  |-  B  =  ( Base `  K
)
2 cdlemk1.l . 2  |-  .<_  =  ( le `  K )
3 cdlemk1.j . 2  |-  .\/  =  ( join `  K )
4 cdlemk1.a . 2  |-  A  =  ( Atoms `  K )
5 cdlemk1.h . 2  |-  H  =  ( LHyp `  K
)
6 cdlemk1.t . 2  |-  T  =  ( ( LTrn `  K
) `  W )
7 cdlemk1.r . 2  |-  R  =  ( ( trL `  K
) `  W )
8 cdlemk1.m . 2  |-  ./\  =  ( meet `  K )
9 cdlemk1.u . 2  |-  U  =  ( e  e.  T  |->  ( iota_ j  e.  T  ( j `  P
)  =  ( ( P  .\/  ( R `
 e ) ) 
./\  ( ( O `
 P )  .\/  ( R `  ( e  o.  `' D ) ) ) ) ) )
101, 2, 3, 4, 5, 6, 7, 8, 9cdlemksv 37022 1  |-  ( G  e.  T  ->  ( U `  G )  =  ( iota_ j  e.  T  ( j `  P )  =  ( ( P  .\/  ( R `  G )
)  ./\  ( ( O `  P )  .\/  ( R `  ( G  o.  `' D
) ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1399    e. wcel 1836    |-> cmpt 4442   `'ccnv 4929    o. ccom 4934   ` cfv 5513   iota_crio 6179  (class class class)co 6218   Basecbs 14657   lecple 14732   joincjn 15713   meetcmee 15714   Atomscatm 35440   LHypclh 36160   LTrncltrn 36277   trLctrl 36335
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1633  ax-4 1646  ax-5 1719  ax-6 1765  ax-7 1808  ax-9 1840  ax-10 1855  ax-11 1860  ax-12 1872  ax-13 2020  ax-ext 2374  ax-sep 4505  ax-nul 4513  ax-pr 4618
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1402  df-ex 1628  df-nf 1632  df-sb 1758  df-eu 2236  df-mo 2237  df-clab 2382  df-cleq 2388  df-clel 2391  df-nfc 2546  df-ne 2593  df-ral 2751  df-rex 2752  df-rab 2755  df-v 3053  df-sbc 3270  df-dif 3409  df-un 3411  df-in 3413  df-ss 3420  df-nul 3729  df-if 3875  df-sn 3962  df-pr 3964  df-op 3968  df-uni 4181  df-br 4385  df-opab 4443  df-mpt 4444  df-id 4726  df-xp 4936  df-rel 4937  df-cnv 4938  df-co 4939  df-dm 4940  df-iota 5477  df-fun 5515  df-fv 5521  df-riota 6180  df-ov 6221
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator