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

Theorem resseqnbasd 13404
Description: The components of an extensible structure except the base set remain unchanged on a structure restriction. (Contributed by Mario Carneiro, 26-Nov-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) (Revised by AV, 19-Oct-2024.)
Hypotheses
Ref Expression
resseqnbas.r  |-  R  =  ( Ws  A )
resseqnbas.e  |-  C  =  ( E `  W
)
resseqnbasd.f  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
resseqnbas.n  |-  ( E `
 ndx )  =/=  ( Base `  ndx )
resseqnbasd.w  |-  ( ph  ->  W  e.  X )
resseqnbasd.a  |-  ( ph  ->  A  e.  V )
Assertion
Ref Expression
resseqnbasd  |-  ( ph  ->  C  =  ( E `
 R ) )

Proof of Theorem resseqnbasd
StepHypRef Expression
1 resseqnbas.e . 2  |-  C  =  ( E `  W
)
2 resseqnbas.r . . . . 5  |-  R  =  ( Ws  A )
3 resseqnbasd.w . . . . . 6  |-  ( ph  ->  W  e.  X )
4 resseqnbasd.a . . . . . 6  |-  ( ph  ->  A  e.  V )
5 ressvalsets 13395 . . . . . 6  |-  ( ( W  e.  X  /\  A  e.  V )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
63, 4, 5syl2anc 415 . . . . 5  |-  ( ph  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
72, 6eqtrid 2283 . . . 4  |-  ( ph  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
87fveq2d 5694 . . 3  |-  ( ph  ->  ( E `  R
)  =  ( E `
 ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
9 inex1g 4264 . . . . 5  |-  ( A  e.  V  ->  ( A  i^i  ( Base `  W
) )  e.  _V )
104, 9syl 14 . . . 4  |-  ( ph  ->  ( A  i^i  ( Base `  W ) )  e.  _V )
11 resseqnbasd.f . . . . 5  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
12 resseqnbas.n . . . . 5  |-  ( E `
 ndx )  =/=  ( Base `  ndx )
13 basendxnn 13386 . . . . 5  |-  ( Base `  ndx )  e.  NN
1411, 12, 13setsslnid 13382 . . . 4  |-  ( ( W  e.  X  /\  ( A  i^i  ( Base `  W ) )  e.  _V )  -> 
( E `  W
)  =  ( E `
 ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
153, 10, 14syl2anc 415 . . 3  |-  ( ph  ->  ( E `  W
)  =  ( E `
 ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
168, 15eqtr4d 2274 . 2  |-  ( ph  ->  ( E `  R
)  =  ( E `
 W ) )
171, 16eqtr4id 2290 1  |-  ( ph  ->  C  =  ( E `
 R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    i^i cin 3219   <.cop 3708   ` cfv 5372  (class class class)co 6075   NNcn 9283   ndxcnx 13327   sSet csts 13328  Slot cslot 13329   Basecbs 13330   ↾s cress 13331
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 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem 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-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-inn 9284  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338
This theorem is referenced by:  ressplusgd  13460  ressmulrg  13476  ressscag  13514  ressvscag  13515  ressipg  13516
  Copyright terms: Public domain W3C validator