| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgr0e | Structured version Visualization version GIF version | ||
| Description: The empty graph, with vertices but no edges, is a simple graph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.) (Proof shortened by AV, 25-Nov-2020.) |
| Ref | Expression |
|---|---|
| usgr0e.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| usgr0e.e | ⊢ (𝜑 → (iEdg‘𝐺) = ∅) |
| Ref | Expression |
|---|---|
| usgr0e | ⊢ (𝜑 → 𝐺 ∈ USGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgr0e.e | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = ∅) | |
| 2 | 1 | f10d 6855 | . 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 3 | usgr0e.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 4 | eqid 2762 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 5 | eqid 2762 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 6 | 4, 5 | isusgr 29514 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 7 | 3, 6 | syl 18 | . 2 ⊢ (𝜑 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 8 | 2, 7 | mpbird 260 | 1 ⊢ (𝜑 → 𝐺 ∈ USGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2142 {crab 3415 ∖ cdif 3901 ∅c0 4285 𝒫 cpw 4561 {csn 4588 dom cdm 5660 –1-1→wf1 6533 ‘cfv 6536 2c2 12301 ♯chash 14373 Vtxcvtx 29357 iEdgciedg 29358 USGraphcusgr 29510 |
| 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-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 |
| 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-sb 2096 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 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-fn 6539 df-f 6540 df-f1 6541 df-fv 6544 df-usgr 29512 |
| This theorem is used by: usgr0vb 29598 uhgr0vusgr 29603 usgr0eop 29607 edg0usgr 29614 usgr1v 29617 griedg0ssusgr 29626 cusgr1v 29792 frgr0v 30624 |
| Copyright terms: Public domain | W3C validator |