| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > edg0iedg0 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| edg0iedg0.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| edg0iedg0.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| edg0iedg0 | ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | edg0iedg0.e | . . . . 5 ⊢ 𝐸 = (Edg‘𝐺) | |
| 2 | edgval 29410 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 3 | 1, 2 | eqtri 2785 | . . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺) |
| 4 | 3 | eqeq1i 2767 | . . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅) |
| 5 | 4 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)) |
| 6 | edg0iedg0.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | eqcomi 2771 | . . . . 5 ⊢ (iEdg‘𝐺) = 𝐼 |
| 8 | 7 | rneqi 5926 | . . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 9 | 8 | eqeq1i 2767 | . . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅) |
| 10 | 9 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)) |
| 11 | funrel 6553 | . . 3 ⊢ (Fun 𝐼 → Rel 𝐼) | |
| 12 | relrn0 5962 | . . . 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 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∅c0 4285 ran crn 5661 Rel wrel 5665 Fun wfun 6530 ‘cfv 6536 iEdgciedg 29358 Edgcedg 29408 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-iota 6492 df-fun 6538 df-fv 6544 df-edg 29409 |
| This theorem is used by: uhgriedg0edg0 29488 egrsubgr 29638 vtxduhgr0e 29839 |
| Copyright terms: Public domain | W3C validator |