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

Theorem ressbasd 13364
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 4251 . . . 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 13354 . . . 4  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
65setsslid 13347 . . 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 3426 . 2  |-  ( ph  ->  ( A  i^i  B
)  =  ( A  i^i  ( Base `  W
) ) )
10 ressbasd.r . . . 4  |-  ( ph  ->  R  =  ( Ws  A ) )
11 ressvalsets 13361 . . . . 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 2267 . . 3  |-  ( ph  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
1413fveq2d 5679 . 2  |-  ( ph  ->  ( Base `  R
)  =  ( Base `  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
157, 9, 143eqtr4d 2277 1  |-  ( ph  ->  ( A  i^i  B
)  =  ( Base `  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   _Vcvv 2815    i^i cin 3213   <.cop 3697   ` cfv 5357  (class class class)co 6058   ndxcnx 13293   sSet csts 13294   Basecbs 13296   ↾s cress 13297
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-inn 9255  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304
This theorem is referenced by:  ressbas2d  13365  ressbasssd  13366  ressbasid  13367  ressressg  13372  grpressid  13816  opprsubgg  14328  subrngpropd  14462  subrgpropd  14499  sralmod  14724  lidlbas  14752
  Copyright terms: Public domain W3C validator