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

Theorem ressval2 12687
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 12685 . . 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 3358 . . . . 5  |-  ( A  i^i  B )  =  ( A  i^i  ( Base `  W ) )
54opeq2i 3809 . . . 4  |-  <. ( Base `  ndx ) ,  ( A  i^i  B
) >.  =  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>.
65oveq2i 5930 . . 3  |-  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )  =  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. )
71, 2, 63eqtr4g 2251 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  B ) >. )
)
873adant1 1017 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 980    = wceq 1364    e. wcel 2164    i^i cin 3153    C_ wss 3154   <.cop 3622   ` cfv 5255  (class class class)co 5919   ndxcnx 12618   sSet csts 12619   Basecbs 12621   ↾s cress 12622
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-iota 5216  df-fun 5257  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-inn 8985  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator