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

Theorem strressid 13153
Description: Behavior of trivial restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.) (Revised by Jim Kingdon, 17-Jan-2025.)
Hypotheses
Ref Expression
strressid.b  |-  ( ph  ->  B  =  ( Base `  W ) )
strressid.s  |-  ( ph  ->  W Struct  <. M ,  N >. )
strressid.f  |-  ( ph  ->  Fun  W )
strressid.bw  |-  ( ph  ->  ( Base `  ndx )  e.  dom  W )
Assertion
Ref Expression
strressid  |-  ( ph  ->  ( Ws  B )  =  W )

Proof of Theorem strressid
StepHypRef Expression
1 strressid.b . . . . . 6  |-  ( ph  ->  B  =  ( Base `  W ) )
21ineq1d 3407 . . . . 5  |-  ( ph  ->  ( B  i^i  ( Base `  W ) )  =  ( ( Base `  W )  i^i  ( Base `  W ) ) )
3 inidm 3416 . . . . 5  |-  ( (
Base `  W )  i^i  ( Base `  W
) )  =  (
Base `  W )
42, 3eqtrdi 2280 . . . 4  |-  ( ph  ->  ( B  i^i  ( Base `  W ) )  =  ( Base `  W
) )
54opeq2d 3869 . . 3  |-  ( ph  -> 
<. ( Base `  ndx ) ,  ( B  i^i  ( Base `  W
) ) >.  =  <. (
Base `  ndx ) ,  ( Base `  W
) >. )
65oveq2d 6033 . 2  |-  ( ph  ->  ( W sSet  <. ( Base `  ndx ) ,  ( B  i^i  ( Base `  W ) )
>. )  =  ( W sSet  <. ( Base `  ndx ) ,  ( Base `  W ) >. )
)
7 strressid.s . . . 4  |-  ( ph  ->  W Struct  <. M ,  N >. )
8 structex 13093 . . . 4  |-  ( W Struct  <. M ,  N >.  ->  W  e.  _V )
97, 8syl 14 . . 3  |-  ( ph  ->  W  e.  _V )
10 basfn 13140 . . . . 5  |-  Base  Fn  _V
11 funfvex 5656 . . . . . 6  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1211funfni 5432 . . . . 5  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
1310, 9, 12sylancr 414 . . . 4  |-  ( ph  ->  ( Base `  W
)  e.  _V )
141, 13eqeltrd 2308 . . 3  |-  ( ph  ->  B  e.  _V )
15 ressvalsets 13146 . . 3  |-  ( ( W  e.  _V  /\  B  e.  _V )  ->  ( Ws  B )  =  ( W sSet  <. ( Base `  ndx ) ,  ( B  i^i  ( Base `  W
) ) >. )
)
169, 14, 15syl2anc 411 . 2  |-  ( ph  ->  ( Ws  B )  =  ( W sSet  <. ( Base `  ndx ) ,  ( B  i^i  ( Base `  W
) ) >. )
)
17 baseid 13135 . . 3  |-  Base  = Slot  ( Base `  ndx )
18 strressid.f . . 3  |-  ( ph  ->  Fun  W )
19 strressid.bw . . 3  |-  ( ph  ->  ( Base `  ndx )  e.  dom  W )
2017, 7, 18, 19strsetsid 13114 . 2  |-  ( ph  ->  W  =  ( W sSet  <. ( Base `  ndx ) ,  ( Base `  W ) >. )
)
216, 16, 203eqtr4d 2274 1  |-  ( ph  ->  ( Ws  B )  =  W )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   _Vcvv 2802    i^i cin 3199   <.cop 3672   class class class wbr 4088   dom cdm 4725   Fun wfun 5320    Fn wfn 5321   ` cfv 5326  (class class class)co 6017   Struct cstr 13077   ndxcnx 13078   sSet csts 13079   Basecbs 13081   ↾s cress 13082
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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  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-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  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-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-struct 13083  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator