MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ressval Structured version   Unicode version

Theorem ressval 14240
Description: Value of structure restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.)
Hypotheses
Ref Expression
ressbas.r  |-  R  =  ( Ws  A )
ressbas.b  |-  B  =  ( Base `  W
)
Assertion
Ref Expression
ressval  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  R  =  if ( B  C_  A ,  W ,  ( W sSet  <.
( Base `  ndx ) ,  ( A  i^i  B
) >. ) ) )

Proof of Theorem ressval
Dummy variables  a  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ressbas.r . 2  |-  R  =  ( Ws  A )
2 elex 2996 . . 3  |-  ( W  e.  X  ->  W  e.  _V )
3 elex 2996 . . 3  |-  ( A  e.  Y  ->  A  e.  _V )
4 simpl 457 . . . . 5  |-  ( ( W  e.  _V  /\  A  e.  _V )  ->  W  e.  _V )
5 ovex 6131 . . . . 5  |-  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )  e.  _V
6 ifcl 3846 . . . . 5  |-  ( ( W  e.  _V  /\  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B )
>. )  e.  _V )  ->  if ( B 
C_  A ,  W ,  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  B
) >. ) )  e. 
_V )
74, 5, 6sylancl 662 . . . 4  |-  ( ( W  e.  _V  /\  A  e.  _V )  ->  if ( B  C_  A ,  W , 
( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B )
>. ) )  e.  _V )
8 simpl 457 . . . . . . . . 9  |-  ( ( w  =  W  /\  a  =  A )  ->  w  =  W )
98fveq2d 5710 . . . . . . . 8  |-  ( ( w  =  W  /\  a  =  A )  ->  ( Base `  w
)  =  ( Base `  W ) )
10 ressbas.b . . . . . . . 8  |-  B  =  ( Base `  W
)
119, 10syl6eqr 2493 . . . . . . 7  |-  ( ( w  =  W  /\  a  =  A )  ->  ( Base `  w
)  =  B )
12 simpr 461 . . . . . . 7  |-  ( ( w  =  W  /\  a  =  A )  ->  a  =  A )
1311, 12sseq12d 3400 . . . . . 6  |-  ( ( w  =  W  /\  a  =  A )  ->  ( ( Base `  w
)  C_  a  <->  B  C_  A
) )
1412, 11ineq12d 3568 . . . . . . . 8  |-  ( ( w  =  W  /\  a  =  A )  ->  ( a  i^i  ( Base `  w ) )  =  ( A  i^i  B ) )
1514opeq2d 4081 . . . . . . 7  |-  ( ( w  =  W  /\  a  =  A )  -> 
<. ( Base `  ndx ) ,  ( a  i^i  ( Base `  w
) ) >.  =  <. (
Base `  ndx ) ,  ( A  i^i  B
) >. )
168, 15oveq12d 6124 . . . . . 6  |-  ( ( w  =  W  /\  a  =  A )  ->  ( w sSet  <. ( Base `  ndx ) ,  ( a  i^i  ( Base `  w ) )
>. )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
)
1713, 8, 16ifbieq12d 3831 . . . . 5  |-  ( ( w  =  W  /\  a  =  A )  ->  if ( ( Base `  w )  C_  a ,  w ,  ( w sSet  <. ( Base `  ndx ) ,  ( a  i^i  ( Base `  w
) ) >. )
)  =  if ( B  C_  A ,  W ,  ( W sSet  <.
( Base `  ndx ) ,  ( A  i^i  B
) >. ) ) )
18 df-ress 14196 . . . . 5  |-s  =  ( w  e.  _V ,  a  e. 
_V  |->  if ( (
Base `  w )  C_  a ,  w ,  ( w sSet  <. ( Base `  ndx ) ,  ( a  i^i  ( Base `  w ) )
>. ) ) )
1917, 18ovmpt2ga 6235 . . . 4  |-  ( ( W  e.  _V  /\  A  e.  _V  /\  if ( B  C_  A ,  W ,  ( W sSet  <.
( Base `  ndx ) ,  ( A  i^i  B
) >. ) )  e. 
_V )  ->  ( Ws  A )  =  if ( B  C_  A ,  W ,  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
) )
207, 19mpd3an3 1315 . . 3  |-  ( ( W  e.  _V  /\  A  e.  _V )  ->  ( Ws  A )  =  if ( B  C_  A ,  W ,  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
) )
212, 3, 20syl2an 477 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  =  if ( B  C_  A ,  W ,  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
) )
221, 21syl5eq 2487 1  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  R  =  if ( B  C_  A ,  W ,  ( W sSet  <.
( Base `  ndx ) ,  ( A  i^i  B
) >. ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1369    e. wcel 1756   _Vcvv 2987    i^i cin 3342    C_ wss 3343   ifcif 3806   <.cop 3898   ` cfv 5433  (class class class)co 6106   ndxcnx 14186   sSet csts 14187   Basecbs 14189   ↾s cress 14190
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4428  ax-nul 4436  ax-pr 4546
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ne 2622  df-ral 2735  df-rex 2736  df-rab 2739  df-v 2989  df-sbc 3202  df-dif 3346  df-un 3348  df-in 3350  df-ss 3357  df-nul 3653  df-if 3807  df-sn 3893  df-pr 3895  df-op 3899  df-uni 4107  df-br 4308  df-opab 4366  df-id 4651  df-xp 4861  df-rel 4862  df-cnv 4863  df-co 4864  df-dm 4865  df-iota 5396  df-fun 5435  df-fv 5441  df-ov 6109  df-oprab 6110  df-mpt2 6111  df-ress 14196
This theorem is referenced by:  ressid2  14241  ressval2  14242  wunress  14252
  Copyright terms: Public domain W3C validator