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

Theorem edgopval 25869
 Description: The edges of a graph represented as ordered pair. (Contributed by AV, 1-Jan-2020.)
Assertion
Ref Expression
edgopval ((𝑉𝑊𝐸𝑋) → (Edges‘⟨𝑉, 𝐸⟩) = ran 𝐸)

Proof of Theorem edgopval
StepHypRef Expression
1 opex 4859 . . 3 𝑉, 𝐸⟩ ∈ V
2 edgval 25868 . . 3 (⟨𝑉, 𝐸⟩ ∈ V → (Edges‘⟨𝑉, 𝐸⟩) = ran (2nd ‘⟨𝑉, 𝐸⟩))
31, 2mp1i 13 . 2 ((𝑉𝑊𝐸𝑋) → (Edges‘⟨𝑉, 𝐸⟩) = ran (2nd ‘⟨𝑉, 𝐸⟩))
4 op2ndg 7072 . . 3 ((𝑉𝑊𝐸𝑋) → (2nd ‘⟨𝑉, 𝐸⟩) = 𝐸)
54rneqd 5274 . 2 ((𝑉𝑊𝐸𝑋) → ran (2nd ‘⟨𝑉, 𝐸⟩) = ran 𝐸)
63, 5eqtrd 2644 1 ((𝑉𝑊𝐸𝑋) → (Edges‘⟨𝑉, 𝐸⟩) = ran 𝐸)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ⟨cop 4131  ran crn 5039  ‘cfv 5804  2nd c2nd 7058  Edgescedg 25860 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fv 5812  df-2nd 7060  df-edg 25865 This theorem is referenced by:  edgov  25870
 Copyright terms: Public domain W3C validator