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

Theorem 1strbas 13347
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 13287 . 2  |-  ( Base 
= Slot  ( Base `  ndx )  /\  ( Base `  ndx )  e.  NN )
2 1str.g . . 3  |-  G  =  { <. ( Base `  ndx ) ,  B >. }
3 basendxnn 13285 . . . . 5  |-  ( Base `  ndx )  e.  NN
4 opexg 4346 . . . . 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 4299 . . . 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 2321 . 2  |-  ( B  e.  V  ->  G  e.  _V )
9 funsng 5404 . . . 4  |-  ( ( ( Base `  ndx )  e.  NN  /\  B  e.  V )  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
103, 9mpan 424 . . 3  |-  ( B  e.  V  ->  Fun  {
<. ( Base `  ndx ) ,  B >. } )
112funeqi 5375 . . 3  |-  ( Fun 
G  <->  Fun  { <. ( Base `  ndx ) ,  B >. } )
1210, 11sylibr 134 . 2  |-  ( B  e.  V  ->  Fun  G )
13 snidg 3720 . . . 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 2328 . 2  |-  ( B  e.  V  ->  <. ( Base `  ndx ) ,  B >.  e.  G
)
161, 8, 12, 15strslfvd 13271 1  |-  ( B  e.  V  ->  B  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   _Vcvv 2815   {csn 3691   <.cop 3694   Fun wfun 5348   ` cfv 5354   NNcn 9239   ndxcnx 13226   Basecbs 13229
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 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 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-cnex 8220  ax-resscn 8221  ax-1re 8223  ax-addrcl 8226
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2527  df-rex 2528  df-v 2817  df-sbc 3045  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-iota 5314  df-fun 5356  df-fv 5362  df-inn 9240  df-ndx 13232  df-slot 13233  df-base 13235
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator