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

Theorem funvtxdm2vald 16186
Description: The set of vertices of an extensible structure with (at least) two slots. (Contributed by AV, 22-Sep-2020.) (Revised by Jim Kingdon, 11-Dec-2025.)
Hypotheses
Ref Expression
funvtxdm2val.a  |-  A  e. 
_V
funvtxdm2val.b  |-  B  e. 
_V
funvtxdm2vald.g  |-  ( ph  ->  G  e.  X )
funvtxdm2vald.fun  |-  ( ph  ->  Fun  ( G  \  { (/) } ) )
funvtxdm2vald.ne  |-  ( ph  ->  A  =/=  B )
funvtxdm2vald.dm  |-  ( ph  ->  { A ,  B }  C_  dom  G )
Assertion
Ref Expression
funvtxdm2vald  |-  ( ph  ->  (Vtx `  G )  =  ( Base `  G
) )

Proof of Theorem funvtxdm2vald
StepHypRef Expression
1 funvtxdm2vald.g . . 3  |-  ( ph  ->  G  e.  X )
2 vtxvalg 16171 . . 3  |-  ( G  e.  X  ->  (Vtx `  G )  =  if ( G  e.  ( _V  X.  _V ) ,  ( 1st `  G
) ,  ( Base `  G ) ) )
31, 2syl 14 . 2  |-  ( ph  ->  (Vtx `  G )  =  if ( G  e.  ( _V  X.  _V ) ,  ( 1st `  G ) ,  (
Base `  G )
) )
4 funvtxdm2vald.fun . . . 4  |-  ( ph  ->  Fun  ( G  \  { (/) } ) )
5 funvtxdm2vald.ne . . . 4  |-  ( ph  ->  A  =/=  B )
6 funvtxdm2vald.dm . . . 4  |-  ( ph  ->  { A ,  B }  C_  dom  G )
7 funvtxdm2val.a . . . . 5  |-  A  e. 
_V
8 funvtxdm2val.b . . . . 5  |-  B  e. 
_V
97, 8fun2dmnop0 11280 . . . 4  |-  ( ( Fun  ( G  \  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_ 
dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
104, 5, 6, 9syl3anc 1278 . . 3  |-  ( ph  ->  -.  G  e.  ( _V  X.  _V )
)
1110iffalsed 3647 . 2  |-  ( ph  ->  if ( G  e.  ( _V  X.  _V ) ,  ( 1st `  G ) ,  (
Base `  G )
)  =  ( Base `  G ) )
123, 11eqtrd 2271 1  |-  ( ph  ->  (Vtx `  G )  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    \ cdif 3217    C_ wss 3220   (/)c0 3520   ifcif 3635   {csn 3705   {cpr 3706    X. cxp 4767   dom cdm 4769   Fun wfun 5366   ` cfv 5372   1stc1st 6362   Basecbs 13330  Vtxcvtx 16167
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-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 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem 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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-1o 6677  df-2o 6678  df-en 7013  df-dom 7014  df-inn 9284  df-ndx 13333  df-slot 13334  df-base 13336  df-vtx 16169
This theorem is referenced by:  funvtxval0d  16188  funvtxvalg  16191
  Copyright terms: Public domain W3C validator