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

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

Proof of Theorem cdlemkuv-2N
StepHypRef Expression
1 cdlemk2.b . 2  |-  B  =  ( Base `  K
)
2 cdlemk2.l . 2  |-  .<_  =  ( le `  K )
3 cdlemk2.j . 2  |-  .\/  =  ( join `  K )
4 cdlemk2.a . 2  |-  A  =  ( Atoms `  K )
5 cdlemk2.h . 2  |-  H  =  ( LHyp `  K
)
6 cdlemk2.t . 2  |-  T  =  ( ( LTrn `  K
) `  W )
7 cdlemk2.r . 2  |-  R  =  ( ( trL `  K
) `  W )
8 cdlemk2.m . 2  |-  ./\  =  ( meet `  K )
9 cdlemk2.v . 2  |-  V  =  ( d  e.  T  |->  ( iota_ k  e.  T
( k `  P
)  =  ( ( P  .\/  ( R `
 d ) ) 
./\  ( ( Q `
 P )  .\/  ( R `  ( d  o.  `' C ) ) ) ) ) )
101, 2, 3, 4, 5, 6, 7, 8, 9cdlemksv 31033 1  |-  ( G  e.  T  ->  ( V `  G )  =  ( iota_ k  e.  T ( k `  P )  =  ( ( P  .\/  ( R `  G )
)  ./\  ( ( Q `  P )  .\/  ( R `  ( G  o.  `' C
) ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1623    e. wcel 1684    e. cmpt 4077   `'ccnv 4688    o. ccom 4693   ` cfv 5255  (class class class)co 5858   iota_crio 6297   Basecbs 13148   lecple 13215   joincjn 14078   meetcmee 14079   Atomscatm 29453   LHypclh 30173   LTrncltrn 30290   trLctrl 30347
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-iota 5219  df-fun 5257  df-fv 5263  df-ov 5861  df-riota 6304
  Copyright terms: Public domain W3C validator