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

Theorem cdleme31sdnN 31198
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 31-Mar-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdleme31sdn.c  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
cdleme31sdn.d  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
cdleme31sdn.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
Assertion
Ref Expression
cdleme31sdnN  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  [_ s  /  t ]_ D
)
Distinct variable groups:    t,  .\/    t, 
./\    t, P    t, Q    t, U    t, W    t,
s
Allowed substitution hints:    C( t, s)    D( t, s)    P( s)    Q( s)    U( s)    I(
t, s)    .\/ ( s)    .<_ ( t, s)    ./\ ( s)    N( t,
s)    W( s)

Proof of Theorem cdleme31sdnN
StepHypRef Expression
1 cdleme31sdn.n . 2  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  C
)
2 biid 227 . . 3  |-  ( s 
.<_  ( P  .\/  Q
)  <->  s  .<_  ( P 
.\/  Q ) )
3 vex 2804 . . . 4  |-  s  e. 
_V
4 cdleme31sdn.d . . . . 5  |-  D  =  ( ( t  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  t )  ./\  W
) ) )
5 cdleme31sdn.c . . . . 5  |-  C  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
64, 5cdleme31sc 31195 . . . 4  |-  ( s  e.  _V  ->  [_ s  /  t ]_ D  =  C )
73, 6ax-mp 8 . . 3  |-  [_ s  /  t ]_ D  =  C
82, 7ifbieq2i 3597 . 2  |-  if ( s  .<_  ( P  .\/  Q ) ,  I ,  [_ s  /  t ]_ D )  =  if ( s  .<_  ( P 
.\/  Q ) ,  I ,  C )
91, 8eqtr4i 2319 1  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  [_ s  /  t ]_ D
)
Colors of variables: wff set class
Syntax hints:    = wceq 1632    e. wcel 1696   _Vcvv 2801   [_csb 3094   ifcif 3578   class class class wbr 4039  (class class class)co 5874
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-iota 5235  df-fv 5279  df-ov 5877
  Copyright terms: Public domain W3C validator