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

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

Proof of Theorem uspgrloopedg
StepHypRef Expression
1 uspgrloopvtx.g . . . 4 𝐺 = ⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩
21fveq2i 6838 . . 3 (Edg‘𝐺) = (Edg‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩)
3 snex 5382 . . . . 5 {⟨𝐴, {𝑁}⟩} ∈ V
43a1i 11 . . . 4 (𝐴𝑋 → {⟨𝐴, {𝑁}⟩} ∈ V)
5 edgopval 29128 . . . 4 ((𝑉𝑊 ∧ {⟨𝐴, {𝑁}⟩} ∈ V) → (Edg‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩) = ran {⟨𝐴, {𝑁}⟩})
64, 5sylan2 594 . . 3 ((𝑉𝑊𝐴𝑋) → (Edg‘⟨𝑉, {⟨𝐴, {𝑁}⟩}⟩) = ran {⟨𝐴, {𝑁}⟩})
72, 6eqtrid 2784 . 2 ((𝑉𝑊𝐴𝑋) → (Edg‘𝐺) = ran {⟨𝐴, {𝑁}⟩})
8 rnsnopg 6180 . . 3 (𝐴𝑋 → ran {⟨𝐴, {𝑁}⟩} = {{𝑁}})
98adantl 481 . 2 ((𝑉𝑊𝐴𝑋) → ran {⟨𝐴, {𝑁}⟩} = {{𝑁}})
107, 9eqtrd 2772 1 ((𝑉𝑊𝐴𝑋) → (Edg‘𝐺) = {{𝑁}})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3441  {csn 4581  cop 4587  ran crn 5626  cfv 6493  Edgcedg 29124
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6449  df-fun 6495  df-fv 6501  df-2nd 7936  df-iedg 29076  df-edg 29125
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator