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

Theorem resseqnbasd 13161
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 13152 . . . . . 6  |-  ( ( W  e.  X  /\  A  e.  V )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
63, 4, 5syl2anc 411 . . . . 5  |-  ( ph  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
72, 6eqtrid 2276 . . . 4  |-  ( ph  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
87fveq2d 5643 . . 3  |-  ( ph  ->  ( E `  R
)  =  ( E `
 ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
9 inex1g 4225 . . . . 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 13143 . . . . 5  |-  ( Base `  ndx )  e.  NN
1411, 12, 13setsslnid 13139 . . . 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 411 . . 3  |-  ( ph  ->  ( E `  W
)  =  ( E `
 ( W sSet  <. (
Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
168, 15eqtr4d 2267 . 2  |-  ( ph  ->  ( E `  R
)  =  ( E `
 W ) )
171, 16eqtr4id 2283 1  |-  ( ph  ->  C  =  ( E `
 R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202    =/= wne 2402   _Vcvv 2802    i^i cin 3199   <.cop 3672   ` cfv 5326  (class class class)co 6018   NNcn 9143   ndxcnx 13084   sSet csts 13085  Slot cslot 13086   Basecbs 13087   ↾s cress 13088
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-inn 9144  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095
This theorem is referenced by:  ressplusgd  13217  ressmulrg  13233  ressscag  13271  ressvscag  13272  ressipg  13273
  Copyright terms: Public domain W3C validator