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

Theorem edg0iedg0 29405
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 29399 . . . . 5 (Edg‘𝐺) = ran (iEdg‘𝐺)
31, 2eqtri 2786 . . . 4 𝐸 = ran (iEdg‘𝐺)
43eqeq1i 2768 . . 3 (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)
54a1i 11 . 2 (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅))
6 edg0iedg0.i . . . . . 6 𝐼 = (iEdg‘𝐺)
76eqcomi 2772 . . . . 5 (iEdg‘𝐺) = 𝐼
87rneqi 5927 . . . 4 ran (iEdg‘𝐺) = ran 𝐼
98eqeq1i 2768 . . 3 (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)
109a1i 11 . 2 (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅))
11 funrel 6553 . . 3 (Fun 𝐼 → Rel 𝐼)
12 relrn0 5963 . . . 4 (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅))
1312bicomd 226 . . 3 (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
1411, 13syl 18 . 2 (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅))
155, 10, 143bitrd 308 1 (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1570  c0 4286  ran crn 5662  Rel wrel 5666  Fun wfun 6530  cfv 6536  iEdgciedg 29347  Edgcedg 29397
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fv 6544  df-edg 29398
This theorem is referenced by:  uhgriedg0edg0  29477  egrsubgr  29627  vtxduhgr0e  29828
  Copyright terms: Public domain W3C validator