![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cusgr0v | Structured version Visualization version GIF version |
Description: A graph with no vertices and no edges is a complete simple graph. (Contributed by Alexander van der Vekens, 13-Oct-2017.) (Revised by AV, 1-Nov-2020.) |
Ref | Expression |
---|---|
cplgr0v.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
cusgr0v | ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑉 = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ ComplUSGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cplgr0v.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | 1 | eqeq1i 2731 | . . 3 ⊢ (𝑉 = ∅ ↔ (Vtx‘𝐺) = ∅) |
3 | usgr0v 29174 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ (Vtx‘𝐺) = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ USGraph) | |
4 | 2, 3 | syl3an2b 1401 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑉 = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ USGraph) |
5 | 1 | cplgr0v 29360 | . . 3 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑉 = ∅) → 𝐺 ∈ ComplGraph) |
6 | 5 | 3adant3 1129 | . 2 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑉 = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ ComplGraph) |
7 | iscusgr 29351 | . 2 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph)) | |
8 | 4, 6, 7 | sylanbrc 581 | 1 ⊢ ((𝐺 ∈ 𝑊 ∧ 𝑉 = ∅ ∧ (iEdg‘𝐺) = ∅) → 𝐺 ∈ ComplUSGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1534 ∈ wcel 2099 ∅c0 4322 ‘cfv 6546 Vtxcvtx 28929 iEdgciedg 28930 USGraphcusgr 29082 ComplGraphccplgr 29342 ComplUSGraphccusgr 29343 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5296 ax-nul 5303 ax-pow 5361 ax-pr 5425 ax-un 7738 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-i2m1 11217 ax-1ne0 11218 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3464 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-nul 4323 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4906 df-br 5146 df-opab 5208 df-mpt 5229 df-id 5572 df-po 5586 df-so 5587 df-xp 5680 df-rel 5681 df-cnv 5682 df-co 5683 df-dm 5684 df-rn 5685 df-res 5686 df-ima 5687 df-iota 6498 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7419 df-er 8726 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11291 df-mnf 11292 df-xr 11293 df-ltxr 11294 df-le 11295 df-2 12321 df-uhgr 28991 df-upgr 29015 df-uspgr 29083 df-usgr 29084 df-uvtx 29319 df-cplgr 29344 df-cusgr 29345 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |