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

Theorem ressvalsets 12742
Description: Value of structure restriction. (Contributed by Jim Kingdon, 16-Jan-2025.)
Assertion
Ref Expression
ressvalsets  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)

Proof of Theorem ressvalsets
Dummy variables  w  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2774 . . 3  |-  ( W  e.  X  ->  W  e.  _V )
21adantr 276 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  W  e.  _V )
3 elex 2774 . . 3  |-  ( A  e.  Y  ->  A  e.  _V )
43adantl 277 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  A  e.  _V )
5 simpl 109 . . 3  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  W  e.  X )
6 basendxnn 12734 . . . 4  |-  ( Base `  ndx )  e.  NN
76a1i 9 . . 3  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Base `  ndx )  e.  NN )
8 inex1g 4169 . . . 4  |-  ( A  e.  Y  ->  ( A  i^i  ( Base `  W
) )  e.  _V )
98adantl 277 . . 3  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( A  i^i  ( Base `  W ) )  e.  _V )
10 setsex 12710 . . 3  |-  ( ( W  e.  X  /\  ( Base `  ndx )  e.  NN  /\  ( A  i^i  ( Base `  W
) )  e.  _V )  ->  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. )  e.  _V )
115, 7, 9, 10syl3anc 1249 . 2  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. )  e.  _V )
12 id 19 . . . 4  |-  ( w  =  W  ->  w  =  W )
13 fveq2 5558 . . . . . 6  |-  ( w  =  W  ->  ( Base `  w )  =  ( Base `  W
) )
1413ineq2d 3364 . . . . 5  |-  ( w  =  W  ->  (
x  i^i  ( Base `  w ) )  =  ( x  i^i  ( Base `  W ) ) )
1514opeq2d 3815 . . . 4  |-  ( w  =  W  ->  <. ( Base `  ndx ) ,  ( x  i^i  ( Base `  w ) )
>.  =  <. ( Base `  ndx ) ,  ( x  i^i  ( Base `  W ) ) >.
)
1612, 15oveq12d 5940 . . 3  |-  ( w  =  W  ->  (
w sSet  <. ( Base `  ndx ) ,  ( x  i^i  ( Base `  w
) ) >. )  =  ( W sSet  <. (
Base `  ndx ) ,  ( x  i^i  ( Base `  W ) )
>. ) )
17 ineq1 3357 . . . . 5  |-  ( x  =  A  ->  (
x  i^i  ( Base `  W ) )  =  ( A  i^i  ( Base `  W ) ) )
1817opeq2d 3815 . . . 4  |-  ( x  =  A  ->  <. ( Base `  ndx ) ,  ( x  i^i  ( Base `  W ) )
>.  =  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) ) >.
)
1918oveq2d 5938 . . 3  |-  ( x  =  A  ->  ( W sSet  <. ( Base `  ndx ) ,  ( x  i^i  ( Base `  W
) ) >. )  =  ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) )
20 df-iress 12686 . . 3  |-s  =  ( w  e.  _V ,  x  e. 
_V  |->  ( w sSet  <. (
Base `  ndx ) ,  ( x  i^i  ( Base `  w ) )
>. ) )
2116, 19, 20ovmpog 6057 . 2  |-  ( ( W  e.  _V  /\  A  e.  _V  /\  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )  e.  _V )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
222, 4, 11, 21syl3anc 1249 1  |-  ( ( W  e.  X  /\  A  e.  Y )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364    e. wcel 2167   _Vcvv 2763    i^i cin 3156   <.cop 3625   ` cfv 5258  (class class class)co 5922   NNcn 8990   ndxcnx 12675   sSet csts 12676   Basecbs 12678   ↾s cress 12679
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1re 7973  ax-addrcl 7976
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-iota 5219  df-fun 5260  df-fv 5266  df-ov 5925  df-oprab 5926  df-mpo 5927  df-inn 8991  df-ndx 12681  df-slot 12682  df-base 12684  df-sets 12685  df-iress 12686
This theorem is referenced by:  ressex  12743  ressval2  12744  ressbasd  12745  strressid  12749  ressval3d  12750  resseqnbasd  12751  ressinbasd  12752  ressressg  12753  mgpress  13487
  Copyright terms: Public domain W3C validator