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

Theorem cdleme43frv1snN 35696
Description: Value of  [_ R  /  s ]_ N when  -.  R  .<_  ( P  .\/  Q ). (Contributed by NM, 30-Mar-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemefr27.b  |-  B  =  ( Base `  K
)
cdlemefr27.l  |-  .<_  =  ( le `  K )
cdlemefr27.j  |-  .\/  =  ( join `  K )
cdlemefr27.m  |-  ./\  =  ( meet `  K )
cdlemefr27.a  |-  A  =  ( Atoms `  K )
cdlemefr27.h  |-  H  =  ( LHyp `  K
)
cdlemefr27.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdlemefr27.c  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
cdlemefr27.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
cdleme43fr.x  |-  X  =  ( ( R  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )
Assertion
Ref Expression
cdleme43frv1snN  |-  ( ( R  e.  A  /\  -.  R  .<_  ( P 
.\/  Q ) )  ->  [_ R  /  s ]_ N  =  X
)
Distinct variable groups:    A, s    .\/ , s    .<_ , s    ./\ , s    P, s    Q, s    R, s    U, s    W, s    H, s    K, s    B, s
Allowed substitution hints:    C( s)    I(
s)    N( s)    X( s)

Proof of Theorem cdleme43frv1snN
StepHypRef Expression
1 cdlemefr27.c . 2  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
2 cdlemefr27.n . 2  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
3 cdleme43fr.x . 2  |-  X  =  ( ( R  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )
41, 2, 3cdleme31sn2 35677 1  |-  ( ( R  e.  A  /\  -.  R  .<_  ( P 
.\/  Q ) )  ->  [_ R  /  s ]_ N  =  X
)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   [_csb 3533   ifcif 4086   class class class wbr 4653   ` cfv 5888  (class class class)co 6650   Basecbs 15857   lecple 15948   joincjn 16944   meetcmee 16945   Atomscatm 34550   LHypclh 35270
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator