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

Theorem ressbasd 13149
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 4225 . . . 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 13139 . . . 4  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
65setsslid 13132 . . 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 3408 . 2  |-  ( ph  ->  ( A  i^i  B
)  =  ( A  i^i  ( Base `  W
) ) )
10 ressbasd.r . . . 4  |-  ( ph  ->  R  =  ( Ws  A ) )
11 ressvalsets 13146 . . . . 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 5643 . 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 1397    e. wcel 2202   _Vcvv 2802    i^i cin 3199   <.cop 3672   ` cfv 5326  (class class class)co 6017   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-1re 8125  ax-addrcl 8128
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 6020  df-oprab 6021  df-mpo 6022  df-inn 9143  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-iress 13089
This theorem is referenced by:  ressbas2d  13150  ressbasssd  13151  ressbasid  13152  ressressg  13157  grpressid  13643  opprsubgg  14096  subrngpropd  14229  subrgpropd  14266  sralmod  14463  lidlbas  14491
  Copyright terms: Public domain W3C validator