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

Theorem funvtxdm2vald 16026
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 16011 . . 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 11222 . . . 4  |-  ( ( Fun  ( G  \  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_ 
dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
104, 5, 6, 9syl3anc 1274 . . 3  |-  ( ph  ->  -.  G  e.  ( _V  X.  _V )
)
1110iffalsed 3632 . 2  |-  ( ph  ->  if ( G  e.  ( _V  X.  _V ) ,  ( 1st `  G ) ,  (
Base `  G )
)  =  ( Base `  G ) )
123, 11eqtrd 2265 1  |-  ( ph  ->  (Vtx `  G )  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1398    e. wcel 2203    =/= wne 2412   _Vcvv 2813    \ cdif 3208    C_ wss 3211   (/)c0 3508   ifcif 3620   {csn 3689   {cpr 3690    X. cxp 4747   dom cdm 4749   Fun wfun 5346   ` cfv 5352   1stc1st 6332   Basecbs 13212  Vtxcvtx 16007
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 619  ax-in2 620  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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1st 6334  df-1o 6647  df-2o 6648  df-en 6976  df-dom 6977  df-inn 9238  df-ndx 13215  df-slot 13216  df-base 13218  df-vtx 16009
This theorem is referenced by:  funvtxval0d  16028  funvtxvalg  16031
  Copyright terms: Public domain W3C validator