MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  edg0iedg0 Structured version   Visualization version   GIF version

Theorem edg0iedg0 29124
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
StepHypRef Expression
1 edg0iedg0.e . . . . 5 𝐸 = (Edg‘𝐺)
2 edgval 29118 . . . . 5 (Edg‘𝐺) = ran (iEdg‘𝐺)
31, 2eqtri 2759 . . . 4 𝐸 = ran (iEdg‘𝐺)
43eqeq1i 2741 . . 3 (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)
54a1i 11 . 2 (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅))
6 edg0iedg0.i . . . . . 6 𝐼 = (iEdg‘𝐺)
76eqcomi 2745 . . . . 5 (iEdg‘𝐺) = 𝐼
87rneqi 5892 . . . 4 ran (iEdg‘𝐺) = ran 𝐼
98eqeq1i 2741 . . 3 (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)
109a1i 11 . 2 (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅))
11 funrel 6515 . . 3 (Fun 𝐼 → Rel 𝐼)
12 relrn0 5928 . . . 4 (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅))
1312bicomd 223 . . 3 (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
1411, 13syl 17 . 2 (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
155, 10, 143bitrd 305 1 (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  c0 4273  ran crn 5632  Rel wrel 5636  Fun wfun 6492  cfv 6498  iEdgciedg 29066  Edgcedg 29116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fv 6506  df-edg 29117
This theorem is referenced by:  uhgriedg0edg0  29196  egrsubgr  29346  vtxduhgr0e  29547
  Copyright terms: Public domain W3C validator