Theorem 1strbas 13471

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

Step	Hyp	Ref	Expression
1		baseslid 13410	. 2 |- ( Base = Slot ( Base ` ndx ) /\ ( Base ` ndx ) e. NN )
2		1str.g	. . 3 |- G = { <. ( Base ` ndx ) , B >. }
3		basendxnn 13408	. . . . 5 |- ( Base ` ndx ) e. NN
4		opexg 4368	. . . . 5 |- ( ( ( Base ` ndx ) e. NN /\ B e. V ) -> <. ( Base ` ndx ) , B >. e. _V )
5	3, 4	mpan 428	. . . 4 |- ( B e. V -> <. ( Base ` ndx ) , B >. e. _V )
6		snexg 4321	. . . 4 |- ( <. ( Base ` ndx ) , B >. e. _V -> { <. ( Base ` ndx ) , B >. } e. _V )
7	5, 6	syl 14	. . 3 |- ( B e. V -> { <. ( Base ` ndx ) , B >. } e. _V )
8	2, 7	eqeltrid 2325	. 2 |- ( B e. V -> G e. _V )
9		funsng 5427	. . . 4 |- ( ( ( Base ` ndx ) e. NN /\ B e. V ) -> Fun { <. ( Base ` ndx ) , B >. } )
10	3, 9	mpan 428	. . 3 |- ( B e. V -> Fun { <. ( Base ` ndx ) , B >. } )
11	2	funeqi 5398	. . 3 |- ( Fun G <-> Fun { <. ( Base ` ndx ) , B >. } )
12	10, 11	sylibr 134	. 2 |- ( B e. V -> Fun G )
13		snidg 3738	. . . 4 |- ( <. ( Base ` ndx ) , B >. e. _V -> <. ( Base ` ndx ) , B >. e. { <. ( Base ` ndx ) , B >. } )
14	5, 13	syl 14	. . 3 |- ( B e. V -> <. ( Base ` ndx ) , B >. e. { <. ( Base ` ndx ) , B >. } )
15	14, 2	eleqtrrdi 2332	. 2 |- ( B e. V -> <. ( Base ` ndx ) , B >. e. G )
16	1, 8, 12, 15	strslfvd 13394	1 |- ( B e. V -> B = ( Base ` G ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   _Vcvv 2821   {csn 3709   <.cop 3712   Fun wfun 5371   ` cfv 5377   NNcn 9304   ndxcnx 13349   Basecbs 13352

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-inn 9305  df-ndx 13355  df-slot 13356  df-base 13358

This theorem is used by: (None)