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

Theorem ressbasd 12685
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 4165 . . . 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 12675 . . . 4  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
65setsslid 12669 . . 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 3360 . 2  |-  ( ph  ->  ( A  i^i  B
)  =  ( A  i^i  ( Base `  W
) ) )
10 ressbasd.r . . . 4  |-  ( ph  ->  R  =  ( Ws  A ) )
11 ressvalsets 12682 . . . . 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 2226 . . 3  |-  ( ph  ->  R  =  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W
) ) >. )
)
1413fveq2d 5558 . 2  |-  ( ph  ->  ( Base `  R
)  =  ( Base `  ( W sSet  <. ( Base `  ndx ) ,  ( A  i^i  ( Base `  W ) )
>. ) ) )
157, 9, 143eqtr4d 2236 1  |-  ( ph  ->  ( A  i^i  B
)  =  ( Base `  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2164   _Vcvv 2760    i^i cin 3152   <.cop 3621   ` cfv 5254  (class class class)co 5918   ndxcnx 12615   sSet csts 12616   Basecbs 12618   ↾s cress 12619
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-inn 8983  df-ndx 12621  df-slot 12622  df-base 12624  df-sets 12625  df-iress 12626
This theorem is referenced by:  ressbas2d  12686  ressbasssd  12687  ressbasid  12688  ressressg  12693  grpressid  13133  opprsubgg  13580  subrngpropd  13712  subrgpropd  13749  sralmod  13946  lidlbas  13974
  Copyright terms: Public domain W3C validator