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

Theorem 1strbas 13145
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 13085 . 2  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
2 1str.g . . 3  |-  G  =  { <. ( Base `  ndx ) ,  B >. }
3 basendxnn 13083 . . . . 5  |-  ( Base `  ndx )  e.  NN
4 opexg 4313 . . . . 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 4267 . . . 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 2316 . 2  |-  ( B  e.  V  ->  G  e.  _V )
9 funsng 5366 . . . 4  |-  ( ( ( Base `  ndx )  e.  NN  /\  B  e.  V )  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
103, 9mpan 424 . . 3  |-  ( B  e.  V  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
112funeqi 5338 . . 3  |-  ( Fun 
G  <->  Fun  { <. ( Base `  ndx ) ,  B >. } )
1210, 11sylibr 134 . 2  |-  ( B  e.  V  ->  Fun  G )
13 snidg 3695 . . . 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 2323 . 2  |-  ( B  e.  V  ->  <. ( Base `  ndx ) ,  B >.  e.  G
)
161, 8, 12, 15strslfvd 13069 1  |-  ( B  e.  V  ->  B  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   _Vcvv 2799   {csn 3666   <.cop 3669   Fun wfun 5311   ` cfv 5317   NNcn 9106   ndxcnx 13024   Basecbs 13027
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-cnex 8086  ax-resscn 8087  ax-1re 8089  ax-addrcl 8092
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-iota 5277  df-fun 5319  df-fv 5325  df-inn 9107  df-ndx 13030  df-slot 13031  df-base 13033
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator