| 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 29207 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 3 | 1, 2 | eqtri 2784 | . . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺) |
| 4 | 3 | eqeq1i 2766 | . . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅) |
| 5 | 4 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)) |
| 6 | edg0iedg0.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | eqcomi 2770 | . . . . 5 ⊢ (iEdg‘𝐺) = 𝐼 |
| 8 | 7 | rneqi 5909 | . . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 9 | 8 | eqeq1i 2766 | . . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅) |
| 10 | 9 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)) |
| 11 | funrel 6533 | . . 3 ⊢ (Fun 𝐼 → Rel 𝐼) | |
| 12 | relrn0 5945 | . . . 4 ⊢ (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅)) | |
| 13 | 12 | bicomd 225 | . . 3 ⊢ (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅)) |
| 14 | 11, 13 | syl 17 | . 2 ⊢ (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅)) |
| 15 | 5, 10, 14 | 3bitrd 307 | 1 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1559 ∅c0 4283 ran crn 5644 Rel wrel 5648 Fun wfun 6510 ‘cfv 6516 iEdgciedg 29155 Edgcedg 29205 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-iota 6472 df-fun 6518 df-fv 6524 df-edg 29206 |
| This theorem is referenced by: uhgriedg0edg0 29285 egrsubgr 29435 vtxduhgr0e 29636 |
| Copyright terms: Public domain | W3C validator |