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

Theorem basvtxval2dom 16275
Description: The set of vertices of a graph represented as an extensible structure with the set of vertices as base set. (Contributed by AV, 14-Oct-2020.) (Revised by AV, 12-Nov-2021.)
Hypotheses
Ref Expression
basvtxval.s  |-  ( ph  ->  G Struct  X )
basvtxval2dom.d  |-  ( ph  ->  2o  ~<_  dom  G )
basvtxval.v  |-  ( ph  ->  V  e.  Y )
basvtxval.b  |-  ( ph  -> 
<. ( Base `  ndx ) ,  V >.  e.  G )
Assertion
Ref Expression
basvtxval2dom  |-  ( ph  ->  (Vtx `  G )  =  V )

Proof of Theorem basvtxval2dom
StepHypRef Expression
1 basvtxval.s . . . 4  |-  ( ph  ->  G Struct  X )
2 structex 13364 . . . 4  |-  ( G Struct  X  ->  G  e.  _V )
31, 2syl 14 . . 3  |-  ( ph  ->  G  e.  _V )
4 structn0fun 13365 . . . 4  |-  ( G Struct  X  ->  Fun  ( G  \  { (/) } ) )
51, 4syl 14 . . 3  |-  ( ph  ->  Fun  ( G  \  { (/) } ) )
6 basvtxval2dom.d . . 3  |-  ( ph  ->  2o  ~<_  dom  G )
7 funvtxdm2domval 16270 . . 3  |-  ( ( G  e.  _V  /\  Fun  ( G  \  { (/)
} )  /\  2o  ~<_  dom  G )  ->  (Vtx `  G )  =  (
Base `  G )
)
83, 5, 6, 7syl3anc 1278 . 2  |-  ( ph  ->  (Vtx `  G )  =  ( Base `  G
) )
9 basvtxval.v . . 3  |-  ( ph  ->  V  e.  Y )
10 basvtxval.b . . 3  |-  ( ph  -> 
<. ( Base `  ndx ) ,  V >.  e.  G )
111, 9, 10opelstrbas 13469 . 2  |-  ( ph  ->  V  =  ( Base `  G ) )
128, 11eqtr4d 2274 1  |-  ( ph  ->  (Vtx `  G )  =  V )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    \ cdif 3217   (/)c0 3520   {csn 3709   <.cop 3712   class class class wbr 4130   dom cdm 4774   Fun wfun 5371   ` cfv 5377   2oc2o 6681    ~<_ cdom 7021   Struct cstr 13348   ndxcnx 13349   Basecbs 13352  Vtxcvtx 16253
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-nul 4259  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-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  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-suc 4516  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-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-fv 5385  df-1st 6374  df-1o 6687  df-2o 6688  df-dom 7024  df-inn 9305  df-struct 13354  df-ndx 13355  df-slot 13356  df-base 13358  df-vtx 16255
This theorem is used by:  structvtxval  16280  structgrssvtx  16283
  Copyright terms: Public domain W3C validator