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

Theorem ressval2 12528
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 12526 . . 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 3335 . . . . 5  |-  ( A  i^i  B )  =  ( A  i^i  ( Base `  W ) )
54opeq2i 3784 . . . 4  |-  <. ( Base `  ndx ) ,  ( A  i^i  B
) >.  =  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>.
65oveq2i 5888 . . 3  |-  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )  =  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. )
71, 2, 63eqtr4g 2235 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
)
873adant1 1015 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
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353    e. wcel 2148    i^i cin 3130    C_ wss 3131   <.cop 3597   ` cfv 5218  (class class class)co 5877   ndxcnx 12461   sSet csts 12462   Basecbs 12464   ↾s cress 12465
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-iota 5180  df-fun 5220  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-inn 8922  df-ndx 12467  df-slot 12468  df-base 12470  df-sets 12471  df-iress 12472
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator