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

Theorem umgr2v2eedg 29488
Description: The set of edges in a multigraph with two edges connecting the same two vertices. (Contributed by AV, 17-Dec-2020.)
Hypothesis
Ref Expression
umgr2v2evtx.g 𝐺 = ⟨𝑉, {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩}⟩
Assertion
Ref Expression
umgr2v2eedg ((𝑉𝑊𝐴𝑉𝐵𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}})

Proof of Theorem umgr2v2eedg
StepHypRef Expression
1 edgval 29012 . . 3 (Edg‘𝐺) = ran (iEdg‘𝐺)
21a1i 11 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (Edg‘𝐺) = ran (iEdg‘𝐺))
3 umgr2v2evtx.g . . . 4 𝐺 = ⟨𝑉, {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩}⟩
43umgr2v2eiedg 29487 . . 3 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (iEdg‘𝐺) = {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩})
54rneqd 5884 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran (iEdg‘𝐺) = ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩})
6 c0ex 11128 . . . . 5 0 ∈ V
7 1ex 11130 . . . . 5 1 ∈ V
8 rnpropg 6175 . . . . 5 ((0 ∈ V ∧ 1 ∈ V) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}})
96, 7, 8mp2an 692 . . . 4 ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}}
109a1i 11 . . 3 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}})
11 dfsn2 4592 . . 3 {{𝐴, 𝐵}} = {{𝐴, 𝐵}, {𝐴, 𝐵}}
1210, 11eqtr4di 2782 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}})
132, 5, 123eqtrd 2768 1 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}})
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1540  wcel 2109  Vcvv 3438  {csn 4579  {cpr 4581  cop 4585  ran crn 5624  cfv 6486  0cc0 11028  1c1 11029  iEdgciedg 28960  Edgcedg 29010
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7675  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-mulcl 11090  ax-i2m1 11096
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-iota 6442  df-fun 6488  df-fv 6494  df-2nd 7932  df-iedg 28962  df-edg 29011
This theorem is referenced by:  umgr2v2enb1  29490
  Copyright terms: Public domain W3C validator