![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > usgr0eop | 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.) |
Ref | Expression |
---|---|
usgr0eop | ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ∅〉 ∈ USGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opex 5321 | . . 3 ⊢ 〈𝑉, ∅〉 ∈ V | |
2 | 1 | a1i 11 | . 2 ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ∅〉 ∈ V) |
3 | 0ex 5175 | . . 3 ⊢ ∅ ∈ V | |
4 | opiedgfv 26800 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ ∅ ∈ V) → (iEdg‘〈𝑉, ∅〉) = ∅) | |
5 | 3, 4 | mpan2 690 | . 2 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘〈𝑉, ∅〉) = ∅) |
6 | 2, 5 | usgr0e 27026 | 1 ⊢ (𝑉 ∈ 𝑊 → 〈𝑉, ∅〉 ∈ USGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∅c0 4243 〈cop 4531 ‘cfv 6324 iEdgciedg 26790 USGraphcusgr 26942 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fv 6332 df-2nd 7672 df-iedg 26792 df-usgr 26944 |
This theorem is referenced by: rgrusgrprc 27379 |
Copyright terms: Public domain | W3C validator |