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

Theorem cdleme31se 31193
Description: Part of proof of Lemma D in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.)
Hypotheses
Ref Expression
cdleme31se.e  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )
cdleme31se.y  |-  Y  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) )
Assertion
Ref Expression
cdleme31se  |-  ( R  e.  A  ->  [_ R  /  s ]_ E  =  Y )
Distinct variable groups:    A, s    D, s    .\/ , s    ./\ , s    P, s    Q, s    R, s    W, s    T, s
Allowed substitution hints:    E( s)    Y( s)

Proof of Theorem cdleme31se
StepHypRef Expression
1 nfcvd 2433 . . 3  |-  ( R  e.  A  ->  F/_ s
( ( P  .\/  Q )  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) ) )
2 oveq1 5881 . . . . . 6  |-  ( s  =  R  ->  (
s  .\/  T )  =  ( R  .\/  T ) )
32oveq1d 5889 . . . . 5  |-  ( s  =  R  ->  (
( s  .\/  T
)  ./\  W )  =  ( ( R 
.\/  T )  ./\  W ) )
43oveq2d 5890 . . . 4  |-  ( s  =  R  ->  ( D  .\/  ( ( s 
.\/  T )  ./\  W ) )  =  ( D  .\/  ( ( R  .\/  T ) 
./\  W ) ) )
54oveq2d 5890 . . 3  |-  ( s  =  R  ->  (
( P  .\/  Q
)  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )  =  ( ( P  .\/  Q
)  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) ) )
61, 5csbiegf 3134 . 2  |-  ( R  e.  A  ->  [_ R  /  s ]_ (
( P  .\/  Q
)  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )  =  ( ( P  .\/  Q
)  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) ) )
7 cdleme31se.e . . 3  |-  E  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )
87csbeq2i 3120 . 2  |-  [_ R  /  s ]_ E  =  [_ R  /  s ]_ ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )
9 cdleme31se.y . 2  |-  Y  =  ( ( P  .\/  Q )  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) )
106, 8, 93eqtr4g 2353 1  |-  ( R  e.  A  ->  [_ R  /  s ]_ E  =  Y )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1632    e. wcel 1696   [_csb 3094  (class class class)co 5874
This theorem is referenced by:  cdleme31sde  31196  cdleme31sn1c  31199
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