| 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 29122 | . . . . 5 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺) | |
| 3 | 1, 2 | eqtri 2759 | . . . 4 ⊢ 𝐸 = ran (iEdg‘𝐺) |
| 4 | 3 | eqeq1i 2741 | . . 3 ⊢ (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅) |
| 5 | 4 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ ran (iEdg‘𝐺) = ∅)) |
| 6 | edg0iedg0.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 7 | 6 | eqcomi 2745 | . . . . 5 ⊢ (iEdg‘𝐺) = 𝐼 |
| 8 | 7 | rneqi 5886 | . . . 4 ⊢ ran (iEdg‘𝐺) = ran 𝐼 |
| 9 | 8 | eqeq1i 2741 | . . 3 ⊢ (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅) |
| 10 | 9 | a1i 11 | . 2 ⊢ (Fun 𝐼 → (ran (iEdg‘𝐺) = ∅ ↔ ran 𝐼 = ∅)) |
| 11 | funrel 6509 | . . 3 ⊢ (Fun 𝐼 → Rel 𝐼) | |
| 12 | relrn0 5922 | . . . 4 ⊢ (Rel 𝐼 → (𝐼 = ∅ ↔ ran 𝐼 = ∅)) | |
| 13 | 12 | bicomd 223 | . . 3 ⊢ (Rel 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅)) |
| 14 | 11, 13 | syl 17 | . 2 ⊢ (Fun 𝐼 → (ran 𝐼 = ∅ ↔ 𝐼 = ∅)) |
| 15 | 5, 10, 14 | 3bitrd 305 | 1 ⊢ (Fun 𝐼 → (𝐸 = ∅ ↔ 𝐼 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∅c0 4285 ran crn 5625 Rel wrel 5629 Fun wfun 6486 ‘cfv 6492 iEdgciedg 29070 Edgcedg 29120 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-edg 29121 |
| This theorem is referenced by: uhgriedg0edg0 29200 egrsubgr 29350 vtxduhgr0e 29552 |
| Copyright terms: Public domain | W3C validator |