| 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 6797 | . 2 ⊢ (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 3 | usgr0e.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 4 | eqid 2731 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 5 | eqid 2731 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 6 | 4, 5 | isusgr 29131 | . . 3 ⊢ (𝐺 ∈ 𝑊 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 7 | 3, 6 | syl 17 | . 2 ⊢ (𝜑 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})) |
| 8 | 2, 7 | mpbird 257 | 1 ⊢ (𝜑 → 𝐺 ∈ USGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2111 {crab 3395 ∖ cdif 3894 ∅c0 4280 𝒫 cpw 4547 {csn 4573 dom cdm 5614 –1-1→wf1 6478 ‘cfv 6481 2c2 12180 ♯chash 14237 Vtxcvtx 28974 iEdgciedg 28975 USGraphcusgr 29127 |
| 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 2113 ax-9 2121 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| 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-sb 2068 df-mo 2535 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-sbc 3737 df-dif 3900 df-un 3902 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fv 6489 df-usgr 29129 |
| This theorem is referenced by: usgr0vb 29215 uhgr0vusgr 29220 usgr0eop 29224 edg0usgr 29231 usgr1v 29234 griedg0ssusgr 29243 cusgr1v 29409 frgr0v 30242 |
| Copyright terms: Public domain | W3C validator |