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

Theorem 1strbas 12576
Description: The base set of a constructed one-slot structure. (Contributed by AV, 27-Mar-2020.)
Hypothesis
Ref Expression
1str.g  |-  G  =  { <. ( Base `  ndx ) ,  B >. }
Assertion
Ref Expression
1strbas  |-  ( B  e.  V  ->  B  =  ( Base `  G
) )

Proof of Theorem 1strbas
StepHypRef Expression
1 baseslid 12519 . 2  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
2 1str.g . . 3  |-  G  =  { <. ( Base `  ndx ) ,  B >. }
3 basendxnn 12518 . . . . 5  |-  ( Base `  ndx )  e.  NN
4 opexg 4229 . . . . 5  |-  ( ( ( Base `  ndx )  e.  NN  /\  B  e.  V )  ->  <. ( Base `  ndx ) ,  B >.  e.  _V )
53, 4mpan 424 . . . 4  |-  ( B  e.  V  ->  <. ( Base `  ndx ) ,  B >.  e.  _V )
6 snexg 4185 . . . 4  |-  ( <.
( Base `  ndx ) ,  B >.  e.  _V  ->  { <. ( Base `  ndx ) ,  B >. }  e.  _V )
75, 6syl 14 . . 3  |-  ( B  e.  V  ->  { <. (
Base `  ndx ) ,  B >. }  e.  _V )
82, 7eqeltrid 2264 . 2  |-  ( B  e.  V  ->  G  e.  _V )
9 funsng 5263 . . . 4  |-  ( ( ( Base `  ndx )  e.  NN  /\  B  e.  V )  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
103, 9mpan 424 . . 3  |-  ( B  e.  V  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
112funeqi 5238 . . 3  |-  ( Fun 
G  <->  Fun  { <. ( Base `  ndx ) ,  B >. } )
1210, 11sylibr 134 . 2  |-  ( B  e.  V  ->  Fun  G )
13 snidg 3622 . . . 4  |-  ( <.
( Base `  ndx ) ,  B >.  e.  _V  -> 
<. ( Base `  ndx ) ,  B >.  e. 
{ <. ( Base `  ndx ) ,  B >. } )
145, 13syl 14 . . 3  |-  ( B  e.  V  ->  <. ( Base `  ndx ) ,  B >.  e.  { <. (
Base `  ndx ) ,  B >. } )
1514, 2eleqtrrdi 2271 . 2  |-  ( B  e.  V  ->  <. ( Base `  ndx ) ,  B >.  e.  G
)
161, 8, 12, 15strslfvd 12504 1  |-  ( B  e.  V  ->  B  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1353    e. wcel 2148   _Vcvv 2738   {csn 3593   <.cop 3596   Fun wfun 5211   ` cfv 5217   NNcn 8919   ndxcnx 12459   Basecbs 12462
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-cnex 7902  ax-resscn 7903  ax-1re 7905  ax-addrcl 7908
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-sbc 2964  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-int 3846  df-br 4005  df-opab 4066  df-mpt 4067  df-id 4294  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-iota 5179  df-fun 5219  df-fv 5225  df-inn 8920  df-ndx 12465  df-slot 12466  df-base 12468
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator