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

Theorem cdleme31sn1 29700
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 26-Feb-2013.)
Hypotheses
Ref Expression
cdleme31sn1.i  |-  I  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G ) )
cdleme31sn1.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  D
)
cdleme31sn1.c  |-  C  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) )
Assertion
Ref Expression
cdleme31sn1  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  [_ R  /  s ]_ N  =  C )
Distinct variable groups:    t, s,
y, A    B, s    .\/ , s    .<_ , s    P, s    Q, s    R, s, t, y    W, s
Allowed substitution hints:    B( y, t)    C( y, t, s)    D( y, t, s)    P( y, t)    Q( y, t)    G( y, t, s)    I( y, t, s)    .\/ ( y, t)    .<_ ( y, t)    N( y, t, s)    W( y, t)

Proof of Theorem cdleme31sn1
StepHypRef Expression
1 cdleme31sn1.n . . . 4  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  D
)
2 eqid 2256 . . . 4  |-  if ( R  .<_  ( P  .\/  Q ) ,  [_ R  /  s ]_ I ,  [_ R  /  s ]_ D )  =  if ( R  .<_  ( P 
.\/  Q ) , 
[_ R  /  s ]_ I ,  [_ R  /  s ]_ D
)
31, 2cdleme31sn 29699 . . 3  |-  ( R  e.  A  ->  [_ R  /  s ]_ N  =  if ( R  .<_  ( P  .\/  Q ) ,  [_ R  / 
s ]_ I ,  [_ R  /  s ]_ D
) )
43adantr 453 . 2  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  [_ R  /  s ]_ N  =  if ( R  .<_  ( P  .\/  Q ) ,  [_ R  / 
s ]_ I ,  [_ R  /  s ]_ D
) )
5 iftrue 3512 . . . . 5  |-  ( R 
.<_  ( P  .\/  Q
)  ->  if ( R  .<_  ( P  .\/  Q ) ,  [_ R  /  s ]_ I ,  [_ R  /  s ]_ D )  =  [_ R  /  s ]_ I
)
6 cdleme31sn1.i . . . . . 6  |-  I  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G ) )
76csbeq2i 3049 . . . . 5  |-  [_ R  /  s ]_ I  =  [_ R  /  s ]_ ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G ) )
85, 7syl6eq 2304 . . . 4  |-  ( R 
.<_  ( P  .\/  Q
)  ->  if ( R  .<_  ( P  .\/  Q ) ,  [_ R  /  s ]_ I ,  [_ R  /  s ]_ D )  =  [_ R  /  s ]_ ( iota_ y  e.  B A. t  e.  A  (
( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )  ->  y  =  G ) ) )
9 nfcv 2392 . . . . . . . 8  |-  F/_ s A
10 nfv 1629 . . . . . . . . 9  |-  F/ s ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )
11 nfcsb1v 3055 . . . . . . . . . 10  |-  F/_ s [_ R  /  s ]_ G
1211nfeq2 2403 . . . . . . . . 9  |-  F/ s  y  =  [_ R  /  s ]_ G
1310, 12nfim 1735 . . . . . . . 8  |-  F/ s ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G )
149, 13nfral 2567 . . . . . . 7  |-  F/ s A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G )
15 nfcv 2392 . . . . . . 7  |-  F/_ s B
1614, 15nfriota 6247 . . . . . 6  |-  F/_ s
( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) )
1716a1i 12 . . . . 5  |-  ( R  e.  A  ->  F/_ s
( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) ) )
18 csbeq1a 3031 . . . . . . . . 9  |-  ( s  =  R  ->  G  =  [_ R  /  s ]_ G )
1918eqeq2d 2267 . . . . . . . 8  |-  ( s  =  R  ->  (
y  =  G  <->  y  =  [_ R  /  s ]_ G ) )
2019imbi2d 309 . . . . . . 7  |-  ( s  =  R  ->  (
( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G )  <->  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  [_ R  /  s ]_ G
) ) )
2120ralbidv 2534 . . . . . 6  |-  ( s  =  R  ->  ( A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G )  <->  A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  [_ R  /  s ]_ G
) ) )
2221riotabidv 6239 . . . . 5  |-  ( s  =  R  ->  ( iota_ y  e.  B A. t  e.  A  (
( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )  ->  y  =  G ) )  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) ) )
2317, 22csbiegf 3063 . . . 4  |-  ( R  e.  A  ->  [_ R  /  s ]_ ( iota_ y  e.  B A. t  e.  A  (
( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )  ->  y  =  G ) )  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) ) )
248, 23sylan9eqr 2310 . . 3  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  if ( R  .<_  ( P 
.\/  Q ) , 
[_ R  /  s ]_ I ,  [_ R  /  s ]_ D
)  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  [_ R  /  s ]_ G
) ) )
25 cdleme31sn1.c . . 3  |-  C  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) )
2624, 25syl6eqr 2306 . 2  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  if ( R  .<_  ( P 
.\/  Q ) , 
[_ R  /  s ]_ I ,  [_ R  /  s ]_ D
)  =  C )
274, 26eqtrd 2288 1  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  [_ R  /  s ]_ N  =  C )
Colors of variables: wff set class
Syntax hints:   -. wn 5    -> wi 6    /\ wa 360    = wceq 1619    e. wcel 1621   F/_wnfc 2379   A.wral 2516   [_csb 3023   ifcif 3506   class class class wbr 3963  (class class class)co 5757   iota_crio 6228
This theorem is referenced by:  cdleme31sn1c  29707
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ral 2520  df-rex 2521  df-reu 2522  df-rab 2523  df-v 2742  df-sbc 2936  df-csb 3024  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-br 3964  df-opab 4018  df-xp 4640  df-cnv 4642  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fv 4654  df-iota 6190  df-riota 6237
  Copyright terms: Public domain W3C validator