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

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

Proof of Theorem cdleme31sn1c
StepHypRef Expression
1 cdleme31sn1c.i . . 3  |-  I  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  G ) )
2 cdleme31sn1c.n . . 3  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  D
)
3 eqid 2253 . . 3  |-  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  [_ R  /  s ]_ G
) )  =  (
iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G ) )
41, 2, 3cdleme31sn1 29259 . 2  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  [_ R  /  s ]_ N  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  [_ R  /  s ]_ G
) ) )
5 cdleme31sn1c.g . . . . . . . . 9  |-  G  =  ( ( P  .\/  Q )  ./\  ( E  .\/  ( ( s  .\/  t )  ./\  W
) ) )
6 cdleme31sn1c.y . . . . . . . . 9  |-  Y  =  ( ( P  .\/  Q )  ./\  ( E  .\/  ( ( R  .\/  t )  ./\  W
) ) )
75, 6cdleme31se 29260 . . . . . . . 8  |-  ( R  e.  A  ->  [_ R  /  s ]_ G  =  Y )
87adantr 453 . . . . . . 7  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  [_ R  /  s ]_ G  =  Y )
98eqeq2d 2264 . . . . . 6  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  (
y  =  [_ R  /  s ]_ G  <->  y  =  Y ) )
109imbi2d 309 . . . . 5  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  (
( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G )  <->  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  Y ) ) )
1110ralbidv 2527 . . . 4  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  ( A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  [_ R  /  s ]_ G )  <->  A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P 
.\/  Q ) )  ->  y  =  Y ) ) )
1211riotabidv 6192 . . 3  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  ( iota_ y  e.  B A. t  e.  A  (
( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )  ->  y  =  [_ R  /  s ]_ G ) )  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  Y ) ) )
13 cdleme31sn1c.c . . 3  |-  C  =  ( iota_ y  e.  B A. t  e.  A  ( ( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q
) )  ->  y  =  Y ) )
1412, 13syl6eqr 2303 . 2  |-  ( ( R  e.  A  /\  R  .<_  ( P  .\/  Q ) )  ->  ( iota_ y  e.  B A. t  e.  A  (
( -.  t  .<_  W  /\  -.  t  .<_  ( P  .\/  Q ) )  ->  y  =  [_ R  /  s ]_ G ) )  =  C )
154, 14eqtrd 2285 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   A.wral 2509   [_csb 3009   ifcif 3470   class class class wbr 3920  (class class class)co 5710   iota_crio 6181
This theorem is referenced by:  cdlemefs32sn1aw  29292  cdleme43fsv1snlem  29298  cdleme41sn3a  29311  cdleme40m  29345  cdleme40n  29346
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 1926  ax-ext 2234
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 1883  df-eu 2118  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2516  df-v 2729  df-sbc 2922  df-csb 3010  df-dif 3081  df-un 3083  df-in 3085  df-ss 3089  df-nul 3363  df-if 3471  df-sn 3550  df-pr 3551  df-op 3553  df-uni 3728  df-br 3921  df-opab 3975  df-xp 4594  df-cnv 4596  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-fv 4608  df-ov 5713  df-iota 6143  df-riota 6190
  Copyright terms: Public domain W3C validator