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

Theorem ressbasd 13230
Description: Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014.) (Proof shortened by AV, 7-Nov-2024.)
Hypotheses
Ref Expression
ressbasd.r  |-  ( ph  ->  R  =  ( Ws  A ) )
ressbasd.b  |-  ( ph  ->  B  =  ( Base `  W ) )
ressbasd.w  |-  ( ph  ->  W  e.  X )
ressbasd.a  |-  ( ph  ->  A  e.  V )
Assertion
Ref Expression
ressbasd  |-  ( ph  ->  ( A  i^i  B
)  =  ( Base `  R ) )

Proof of Theorem ressbasd
StepHypRef Expression
1 ressbasd.w . . 3  |-  ( ph  ->  W  e.  X )
2 ressbasd.a . . . 4  |-  ( ph  ->  A  e.  V )
3 inex1g 4230 . . . 4  |-  ( A  e.  V  ->  ( A  i^i  ( Base `  W
) )  e.  _V )
42, 3syl 14 . . 3  |-  ( ph  ->  ( A  i^i  ( Base `  W ) )  e.  _V )
5 baseslid 13220 . . . 4  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
65setsslid 13213 . . 3  |-  ( ( W  e.  X  /\  ( A  i^i  ( Base `  W ) )  e.  _V )  -> 
( A  i^i  ( Base `  W ) )  =  ( Base `  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
) )
71, 4, 6syl2anc 411 . 2  |-  ( ph  ->  ( A  i^i  ( Base `  W ) )  =  ( Base `  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
) )
8 ressbasd.b . . 3  |-  ( ph  ->  B  =  ( Base `  W ) )
98ineq2d 3410 . 2  |-  ( ph  ->  ( A  i^i  B
)  =  ( A  i^i  ( Base `  W
) ) )
10 ressbasd.r . . . 4  |-  ( ph  ->  R  =  ( Ws  A ) )
11 ressvalsets 13227 . . . . 5  |-  ( ( W  e.  X  /\  A  e.  V )  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
121, 2, 11syl2anc 411 . . . 4  |-  ( ph  ->  ( Ws  A )  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
1310, 12eqtrd 2264 . . 3  |-  ( ph  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
1413fveq2d 5652 . 2  |-  ( ph  ->  ( Base `  R
)  =  ( Base `  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
157, 9, 143eqtr4d 2274 1  |-  ( ph  ->  ( A  i^i  B
)  =  ( Base `  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202   _Vcvv 2803    i^i cin 3200   <.cop 3676   ` cfv 5333  (class class class)co 6028   ndxcnx 13159   sSet csts 13160   Basecbs 13162   ↾s cress 13163
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-inn 9203  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-iress 13170
This theorem is referenced by:  ressbas2d  13231  ressbasssd  13232  ressbasid  13233  ressressg  13238  grpressid  13724  opprsubgg  14178  subrngpropd  14311  subrgpropd  14348  sralmod  14546  lidlbas  14574
  Copyright terms: Public domain W3C validator