| 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 29336 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 3 | 1, 2 | eqtri 2792 | . . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺) |
| 4 | 3 | eqeq1i 2774 | . . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅) |
| 5 | 4 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)) |
| 6 | edg0iedg0.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | eqcomi 2778 | . . . . 5 ⊢ (iEdg‘𝐺) = 𝐼 |
| 8 | 7 | rneqi 5925 | . . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 9 | 8 | eqeq1i 2774 | . . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅) |
| 10 | 9 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)) |
| 11 | funrel 6551 | . . 3 ⊢ (Fun 𝐼 → Rel 𝐼) | |
| 12 | relrn0 5961 | . . . 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 |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∅c0 4294 ran crn 5660 Rel wrel 5664 Fun wfun 6528 ‘cfv 6534 iEdgciedg 29284 Edgcedg 29334 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-iota 6490 df-fun 6536 df-fv 6542 df-edg 29335 |
| This theorem is referenced by: uhgriedg0edg0 29414 egrsubgr 29564 vtxduhgr0e 29765 |
| Copyright terms: Public domain | W3C validator |