MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  vtxval Structured version   Visualization version   GIF version

Theorem vtxval 27370
Description: The set of vertices of a graph. (Contributed by AV, 9-Jan-2020.) (Revised by AV, 21-Sep-2020.)
Assertion
Ref Expression
vtxval (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺))

Proof of Theorem vtxval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 eleq1 2826 . . . 4 (𝑔 = 𝐺 → (𝑔 ∈ (V × V) ↔ 𝐺 ∈ (V × V)))
2 fveq2 6774 . . . 4 (𝑔 = 𝐺 → (1st𝑔) = (1st𝐺))
3 fveq2 6774 . . . 4 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
41, 2, 3ifbieq12d 4487 . . 3 (𝑔 = 𝐺 → if(𝑔 ∈ (V × V), (1st𝑔), (Base‘𝑔)) = if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺)))
5 df-vtx 27368 . . 3 Vtx = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (1st𝑔), (Base‘𝑔)))
6 fvex 6787 . . . 4 (1st𝐺) ∈ V
7 fvex 6787 . . . 4 (Base‘𝐺) ∈ V
86, 7ifex 4509 . . 3 if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺)) ∈ V
94, 5, 8fvmpt 6875 . 2 (𝐺 ∈ V → (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺)))
10 fvprc 6766 . . 3 𝐺 ∈ V → (Base‘𝐺) = ∅)
11 prcnel 3455 . . . 4 𝐺 ∈ V → ¬ 𝐺 ∈ (V × V))
1211iffalsed 4470 . . 3 𝐺 ∈ V → if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺)) = (Base‘𝐺))
13 fvprc 6766 . . 3 𝐺 ∈ V → (Vtx‘𝐺) = ∅)
1410, 12, 133eqtr4rd 2789 . 2 𝐺 ∈ V → (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺)))
159, 14pm2.61i 182 1 (Vtx‘𝐺) = if(𝐺 ∈ (V × V), (1st𝐺), (Base‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1539  wcel 2106  Vcvv 3432  c0 4256  ifcif 4459   × cxp 5587  cfv 6433  1st c1st 7829  Basecbs 16912  Vtxcvtx 27366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-vtx 27368
This theorem is referenced by:  opvtxval  27373  funvtxdmge2val  27381  funvtxdm2val  27383  snstrvtxval  27407  vtxval0  27409
  Copyright terms: Public domain W3C validator