Theorem opiedgval 28986

Description: The set of indexed edges of a graph represented as an ordered pair of vertices and indexed edges. (Contributed by AV, 21-Sep-2020.)

Assertion

Ref	Expression
opiedgval	⊢ (𝐺 ∈ (V × V) → (iEdg‘𝐺) = (2nd ‘𝐺))

Proof of Theorem opiedgval

Step	Hyp	Ref	Expression
1		iedgval 28981	. 2 ⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))
2		iftrue 4490	. 2 ⊢ (𝐺 ∈ (V × V) → if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) = (2nd ‘𝐺))
3	1, 2	eqtrid 2776	1 ⊢ (𝐺 ∈ (V × V) → (iEdg‘𝐺) = (2nd ‘𝐺))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  Vcvv 3444  ifcif 4484   × cxp 5629  ‘cfv 6499  2^nd c2nd 7946  .efcedgf 28968  iEdgciedg 28977

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 5246  ax-nul 5256  ax-pr 5382

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 3403  df-v 3446  df-dif 3914  df-un 3916  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6452  df-fun 6501  df-fv 6507  df-iedg 28979

This theorem is referenced by:  opiedgfv  28987