Theorem opiedgval 29517

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 29512	. 2 ⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))
2		iftrue 4487	. 2 ⊢ (𝐺 ∈ (V × V) → if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) = (2nd ‘𝐺))
3	1, 2	eqtrid 2807	1 ⊢ (𝐺 ∈ (V × V) → (iEdg‘𝐺) = (2nd ‘𝐺))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ifcif 4481   × cxp 5645  ‘cfv 6527  2^nd c2nd 7983  .efcedgf 29499  iEdgciedg 29508

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-iota 6483  df-fun 6529  df-fv 6535  df-iedg 29510

This theorem is used by:  opiedgfv  29518