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

Theorem cdleme31se 35670
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 2765 . . 3  |-  ( R  e.  A  ->  F/_ s
( ( P  .\/  Q )  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) ) )
2 oveq1 6657 . . . . . 6  |-  ( s  =  R  ->  (
s  .\/  T )  =  ( R  .\/  T ) )
32oveq1d 6665 . . . . 5  |-  ( s  =  R  ->  (
( s  .\/  T
)  ./\  W )  =  ( ( R 
.\/  T )  ./\  W ) )
43oveq2d 6666 . . . 4  |-  ( s  =  R  ->  ( D  .\/  ( ( s 
.\/  T )  ./\  W ) )  =  ( D  .\/  ( ( R  .\/  T ) 
./\  W ) ) )
54oveq2d 6666 . . 3  |-  ( s  =  R  ->  (
( P  .\/  Q
)  ./\  ( D  .\/  ( ( s  .\/  T )  ./\  W )
) )  =  ( ( P  .\/  Q
)  ./\  ( D  .\/  ( ( R  .\/  T )  ./\  W )
) ) )
61, 5csbiegf 3557 . 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 3993 . 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 2681 1  |-  ( R  e.  A  ->  [_ R  /  s ]_ E  =  Y )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1483    e. wcel 1990   [_csb 3533  (class class class)co 6650
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:  cdleme31sde  35673  cdleme31sn1c  35676
  Copyright terms: Public domain W3C validator