Theorem iedgval 29288

Description: The set of indexed edges of a graph. (Contributed by AV, 21-Sep-2020.)

Assertion

Ref	Expression
iedgval	⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))

Proof of Theorem iedgval

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2857	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ (V × V) ↔ 𝐺 ∈ (V × V)))
2		fveq2 6879	. . . 4 ⊢ (𝑔 = 𝐺 → (2nd ‘𝑔) = (2nd ‘𝐺))
3		fveq2 6879	. . . 4 ⊢ (𝑔 = 𝐺 → (.ef‘𝑔) = (.ef‘𝐺))
4	1, 2, 3	ifbieq12d 4518	. . 3 ⊢ (𝑔 = 𝐺 → if(𝑔 ∈ (V × V), (2nd ‘𝑔), (.ef‘𝑔)) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)))
5		df-iedg 29286	. . 3 ⊢ iEdg = (𝑔 ∈ V ↦ if(𝑔 ∈ (V × V), (2nd ‘𝑔), (.ef‘𝑔)))
6		fvex 6892	. . . 4 ⊢ (2nd ‘𝐺) ∈ V
7		fvex 6892	. . . 4 ⊢ (.ef‘𝐺) ∈ V
8	6, 7	ifex 4540	. . 3 ⊢ if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) ∈ V
9	4, 5, 8	fvmpt 6987	. 2 ⊢ (𝐺 ∈ V → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)))
10		fvprc 6871	. . 3 ⊢ (¬ 𝐺 ∈ V → (.ef‘𝐺) = ∅)
11		prcnel 3488	. . . 4 ⊢ (¬ 𝐺 ∈ V → ¬ 𝐺 ∈ (V × V))
12	11	iffalsed 4500	. . 3 ⊢ (¬ 𝐺 ∈ V → if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)) = (.ef‘𝐺))
13		fvprc 6871	. . 3 ⊢ (¬ 𝐺 ∈ V → (iEdg‘𝐺) = ∅)
14	10, 12, 13	3eqtr4rd 2815	. 2 ⊢ (¬ 𝐺 ∈ V → (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺)))
15	9, 14	pm2.61i 184	1 ⊢ (iEdg‘𝐺) = if(𝐺 ∈ (V × V), (2nd ‘𝐺), (.ef‘𝐺))

Syntax hints:  ¬ wn 3   = wceq 1567   ∈ wcel 2149  Vcvv 3463  ∅c0 4294  ifcif 4489   × cxp 5657  ‘cfv 6533  2^nd c2nd 7981  .efcedgf 29275  iEdgciedg 29284

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pr 5402

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6489  df-fun 6535  df-fv 6541  df-iedg 29286

This theorem is referenced by:  opiedgval  29293  funiedgdmge2val  29299  funiedgdm2val  29301  snstriedgval  29325  iedgval0  29327