ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ressval2 Unicode version

Theorem ressval2 13420
Description: Value of nontrivial 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
ressval2  |-  ( ( -.  B  C_  A  /\  W  e.  X  /\  A  e.  Y
)  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B )
>. ) )

Proof of Theorem ressval2
StepHypRef Expression
1 ressvalsets 13418 . . 3  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
2 ressbas.r . . 3  |-  R  =  ( Ws  A )
3 ressbas.b . . . . . 6  |-  B  =  ( Base `  W
)
43ineq2i 3429 . . . . 5  |-  ( A  i^i  B )  =  ( A  i^i  ( Base `  W ) )
54opeq2i 3908 . . . 4  |-  <. ( Base `  ndx ) ,  ( A  i^i  B
) >.  =  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>.
65oveq2i 6096 . . 3  |-  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )  =  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. )
71, 2, 63eqtr4g 2296 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
)
873adant1 1046 1  |-  ( ( -.  B  C_  A  /\  W  e.  X  /\  A  e.  Y
)  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B )
>. ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209    i^i cin 3219    C_ wss 3220   <.cop 3712   ` cfv 5377  (class class class)co 6085   ndxcnx 13349   sSet csts 13350   Basecbs 13352   ↾s cress 13353
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358  df-sets 13359  df-iress 13360
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator