Theorem edg0iedg0 26840

Description: There is no edge in a graph iff its edge function is empty. (Contributed by AV, 15-Dec-2020.) (Revised by AV, 8-Dec-2021.)

Hypotheses

Ref	Expression
edg0iedg0.i	⊢ 𝐼 = (iEdg‘𝐺)
edg0iedg0.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
edg0iedg0	⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅))

Proof of Theorem edg0iedg0

Step	Hyp	Ref	Expression
1		edg0iedg0.e	. . . . 5 ⊢ 𝐸 = (Edg‘𝐺)
2		edgval 26834	. . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
3	1, 2	eqtri 2844	. . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺)
4	3	eqeq1i 2826	. . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)
5	4	a1i 11	. 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅))
6		edg0iedg0.i	. . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺)
7	6	eqcomi 2830	. . . . 5 ⊢ (iEdg‘𝐺) = 𝐼
8	7	rneqi 5807	. . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼
9	8	eqeq1i 2826	. . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)
10	9	a1i 11	. 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅))
11		funrel 6372	. . 3 ⊢ (Fun 𝐼 → Rel 𝐼)
12		relrn0 5840	. . . 4 ⊢ (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅))
13	12	bicomd 225	. . 3 ⊢ (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
14	11, 13	syl 17	. 2 ⊢ (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
15	5, 10, 14	3bitrd 307	1 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅))

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1537  ∅c0 4291  ran crn 5556  Rel wrel 5560  Fun wfun 6349  ‘cfv 6355  iEdgciedg 26782  Edgcedg 26832

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-iota 6314  df-fun 6357  df-fv 6363  df-edg 26833

This theorem is referenced by:  uhgriedg0edg0  26912  egrsubgr  27059  vtxduhgr0e  27260