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

Theorem cdleme43fsv1sn 30537
Description: Value of  [_ R  /  s ]_ N when  R 
.<_  ( P  .\/  Q
). (Contributed by NM, 30-Mar-2013.)
Hypotheses
Ref Expression
cdlemefs32.b  |-  B  =  ( Base `  K
)
cdlemefs32.l  |-  .<_  =  ( le `  K )
cdlemefs32.j  |-  .\/  =  ( join `  K )
cdlemefs32.m  |-  ./\  =  ( meet `  K )
cdlemefs32.a  |-  A  =  ( Atoms `  K )
cdlemefs32.h  |-  H  =  ( LHyp `  K
)
cdlemefs32.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdlemefs32.d  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
cdlemefs32.e  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  t )  ./\  W
) ) )
cdlemefs32.i  |-  I  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  E ) )
cdlemefs32.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
cdleme43fs.y  |-  Y  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
cdleme43fs.z  |-  Z  =  ( ( P  .\/  Q )  ./\  ( Y  .\/  ( ( R  .\/  S )  ./\  W )
) )
Assertion
Ref Expression
cdleme43fsv1sn  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( R  .<_  ( P 
.\/  Q )  /\  -.  S  .<_  ( P 
.\/  Q ) ) )  ->  [_ R  / 
s ]_ N  =  Z )
Distinct variable groups:    t, s,
y, A    B, s,
t, y    y, D    y, E    H, s, t, y    .\/ , s, t, y    K, s, t, y    .<_ , s, t, y    ./\ , s, t, y    P, s, t, y    Q, s, t, y    R, s, t, y    t, U, y    W, s, t, y   
y, Y    D, s    t, S, y    t, Z
Allowed substitution hints:    C( y, t, s)    D( t)    S( s)    U( s)    E( t, s)    I( y, t, s)    N( y, t, s)    Y( t, s)    Z( y, s)

Proof of Theorem cdleme43fsv1sn
StepHypRef Expression
1 cdlemefs32.b . 2  |-  B  =  ( Base `  K
)
2 cdlemefs32.l . 2  |-  .<_  =  ( le `  K )
3 cdlemefs32.j . 2  |-  .\/  =  ( join `  K )
4 cdlemefs32.m . 2  |-  ./\  =  ( meet `  K )
5 cdlemefs32.a . 2  |-  A  =  ( Atoms `  K )
6 cdlemefs32.h . 2  |-  H  =  ( LHyp `  K
)
7 cdlemefs32.u . 2  |-  U  =  ( ( P  .\/  Q )  ./\  W )
8 cdlemefs32.d . 2  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
9 cdlemefs32.e . 2  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  t )  ./\  W
) ) )
10 cdlemefs32.i . 2  |-  I  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  E ) )
11 cdlemefs32.n . 2  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
12 cdleme43fs.y . 2  |-  Y  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
13 cdleme43fs.z . 2  |-  Z  =  ( ( P  .\/  Q )  ./\  ( Y  .\/  ( ( R  .\/  S )  ./\  W )
) )
14 eqid 2389 . 2  |-  ( ( P  .\/  Q ) 
./\  ( D  .\/  ( ( R  .\/  t )  ./\  W
) ) )  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( R  .\/  t )  ./\  W
) ) )
15 eqid 2389 . 2  |-  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  ( ( P  .\/  Q
)  ./\  ( D  .\/  ( ( R  .\/  t )  ./\  W
) ) ) ) )  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  ( ( P  .\/  Q
)  ./\  ( D  .\/  ( ( R  .\/  t )  ./\  W
) ) ) ) )
161, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15cdleme43fsv1snlem 30536 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( R  .<_  ( P 
.\/  Q )  /\  -.  S  .<_  ( P 
.\/  Q ) ) )  ->  [_ R  / 
s ]_ N  =  Z )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1717    =/= wne 2552   A.wral 2651   [_csb 3196   ifcif 3684   class class class wbr 4155   ` cfv 5396  (class class class)co 6022   iota_crio 6480   Basecbs 13398   lecple 13465   joincjn 14330   meetcmee 14331   Atomscatm 29380   HLchlt 29467   LHypclh 30100
This theorem is referenced by:  cdlemefs31fv1  30540
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-13 1719  ax-14 1721  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-rep 4263  ax-sep 4273  ax-nul 4281  ax-pow 4320  ax-pr 4346  ax-un 4643
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2244  df-mo 2245  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-nel 2555  df-ral 2656  df-rex 2657  df-reu 2658  df-rmo 2659  df-rab 2660  df-v 2903  df-sbc 3107  df-csb 3197  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-pw 3746  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-iun 4039  df-iin 4040  df-br 4156  df-opab 4210  df-mpt 4211  df-id 4441  df-xp 4826  df-rel 4827  df-cnv 4828  df-co 4829  df-dm 4830  df-rn 4831  df-res 4832  df-ima 4833  df-iota 5360  df-fun 5398  df-fn 5399  df-f 5400  df-f1 5401  df-fo 5402  df-f1o 5403  df-fv 5404  df-ov 6025  df-oprab 6026  df-mpt2 6027  df-1st 6290  df-2nd 6291  df-undef 6481  df-riota 6487  df-poset 14332  df-plt 14344  df-lub 14360  df-glb 14361  df-join 14362  df-meet 14363  df-p0 14397  df-p1 14398  df-lat 14404  df-clat 14466  df-oposet 29293  df-ol 29295  df-oml 29296  df-covers 29383  df-ats 29384  df-atl 29415  df-cvlat 29439  df-hlat 29468  df-llines 29614  df-lplanes 29615  df-lvols 29616  df-lines 29617  df-psubsp 29619  df-pmap 29620  df-padd 29912  df-lhyp 30104
  Copyright terms: Public domain W3C validator