Theorem edg0iedg0 29690

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 29684	. . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
3	1, 2	eqtri 2786	. . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺)
4	3	eqeq1i 2768	. . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)
5	4	a1i 11	. 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅))
6		edg0iedg0.i	. . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺)
7	6	eqcomi 2772	. . . . 5 ⊢ (iEdg‘𝐺) = 𝐼
8	7	rneqi 5931	. . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼
9	8	eqeq1i 2768	. . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)
10	9	a1i 11	. 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅))
11		funrel 6584	. . 3 ⊢ (Fun 𝐼 → Rel 𝐼)
12		relrn0 5967	. . . 4 ⊢ (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅))
13	12	bicomd 226	. . 3 ⊢ (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
14	11, 13	syl 18	. 2 ⊢ (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
15	5, 10, 14	3bitrd 308	1 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  ∅c0 4281  ran crn 5659  Rel wrel 5663  Fun wfun 6560  ‘cfv 6566  iEdgciedg 29632  Edgcedg 29682

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-edg 29683

This theorem is used by:  uhgriedg0edg0  29762  egrsubgr  29915  vtxduhgr0e  30116