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

Theorem umgr2v2eedg 29505
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 29029 . . 3 (Edg‘𝐺) = ran (iEdg‘𝐺)
21a1i 11 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (Edg‘𝐺) = ran (iEdg‘𝐺))
3 umgr2v2evtx.g . . . 4 𝐺 = ⟨𝑉, {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩}⟩
43umgr2v2eiedg 29504 . . 3 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (iEdg‘𝐺) = {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩})
54rneqd 5882 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran (iEdg‘𝐺) = ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩})
6 c0ex 11113 . . . . 5 0 ∈ V
7 1ex 11115 . . . . 5 1 ∈ V
8 rnpropg 6174 . . . . 5 ((0 ∈ V ∧ 1 ∈ V) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}})
96, 7, 8mp2an 692 . . . 4 ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}}
109a1i 11 . . 3 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}, {𝐴, 𝐵}})
11 dfsn2 4588 . . 3 {{𝐴, 𝐵}} = {{𝐴, 𝐵}, {𝐴, 𝐵}}
1210, 11eqtr4di 2786 . 2 ((𝑉𝑊𝐴𝑉𝐵𝑉) → ran {⟨0, {𝐴, 𝐵}⟩, ⟨1, {𝐴, 𝐵}⟩} = {{𝐴, 𝐵}})
132, 5, 123eqtrd 2772 1 ((𝑉𝑊𝐴𝑉𝐵𝑉) → (Edg‘𝐺) = {{𝐴, 𝐵}})
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wcel 2113  Vcvv 3437  {csn 4575  {cpr 4577  cop 4581  ran crn 5620  cfv 6486  0cc0 11013  1c1 11014  iEdgciedg 28977  Edgcedg 29027
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pr 5372  ax-un 7674  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-mulcl 11075  ax-i2m1 11081
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-iota 6442  df-fun 6488  df-fv 6494  df-2nd 7928  df-iedg 28979  df-edg 29028
This theorem is referenced by:  umgr2v2enb1  29507
  Copyright terms: Public domain W3C validator