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

Theorem funvtxdm2vald 15881
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 15866 . . 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 11110 . . . 4  |-  ( ( Fun  ( G  \  { (/) } )  /\  A  =/=  B  /\  { A ,  B }  C_ 
dom  G )  ->  -.  G  e.  ( _V  X.  _V ) )
104, 5, 6, 9syl3anc 1273 . . 3  |-  ( ph  ->  -.  G  e.  ( _V  X.  _V )
)
1110iffalsed 3615 . 2  |-  ( ph  ->  if ( G  e.  ( _V  X.  _V ) ,  ( 1st `  G ) ,  (
Base `  G )
)  =  ( Base `  G ) )
123, 11eqtrd 2264 1  |-  ( ph  ->  (Vtx `  G )  =  ( Base `  G
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1397    e. wcel 2202    =/= wne 2402   _Vcvv 2802    \ cdif 3197    C_ wss 3200   (/)c0 3494   ifcif 3605   {csn 3669   {cpr 3670    X. cxp 4723   dom cdm 4725   Fun wfun 5320   ` cfv 5326   1stc1st 6300   Basecbs 13081  Vtxcvtx 15862
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1st 6302  df-1o 6581  df-2o 6582  df-en 6909  df-dom 6910  df-inn 9143  df-ndx 13084  df-slot 13085  df-base 13087  df-vtx 15864
This theorem is referenced by:  funvtxval0d  15883  funvtxvalg  15886
  Copyright terms: Public domain W3C validator