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

Theorem uspgrloopvtx 29533
Description: The set of vertices in a graph (simple pseudograph) with one edge which is a loop (see uspgr1v1eop 29266). (Contributed by AV, 17-Dec-2020.)
Hypothesis
Ref Expression
uspgrloopvtx.g 𝐺 = ⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩
Assertion
Ref Expression
uspgrloopvtx (𝑉𝑊 → (Vtx‘𝐺) = 𝑉)

Proof of Theorem uspgrloopvtx
StepHypRef Expression
1 uspgrloopvtx.g . . 3 𝐺 = ⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩
21fveq2i 6909 . 2 (Vtx‘𝐺) = (Vtx‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩)
3 snex 5436 . . 3 {⟨𝐴, {𝑁}⟩} ∈ V
4 opvtxfv 29021 . . 3 ((𝑉𝑊 ∧ {⟨𝐴, {𝑁}⟩} ∈ V) → (Vtx‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩) = 𝑉)
53, 4mpan2 691 . 2 (𝑉𝑊 → (Vtx‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩) = 𝑉)
62, 5eqtrid 2789 1 (𝑉𝑊 → (Vtx‘𝐺) = 𝑉)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2108  Vcvv 3480  {csn 4626  cop 4632  cfv 6561  Vtxcvtx 29013
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-iota 6514  df-fun 6563  df-fv 6569  df-1st 8014  df-vtx 29015
This theorem is referenced by:  uspgrloopvtxel  29534  uspgrloopnb0  29537  uspgrloopvd2  29538
  Copyright terms: Public domain W3C validator