![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cusgruvtxb | Structured version Visualization version GIF version |
Description: A simple graph is complete iff the set of vertices is the set of universal vertices. (Contributed by Alexander van der Vekens, 14-Oct-2017.) (Revised by Alexander van der Vekens, 18-Jan-2018.) (Revised by AV, 1-Nov-2020.) |
Ref | Expression |
---|---|
iscusgrvtx.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
cusgruvtxb | ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ (UnivVtx‘𝐺) = 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iscusgr 29450 | . 2 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph)) | |
2 | ibar 528 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))) | |
3 | iscusgrvtx.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
4 | 3 | cplgruvtxb 29445 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplGraph ↔ (UnivVtx‘𝐺) = 𝑉)) |
5 | 2, 4 | bitr3d 281 | . 2 ⊢ (𝐺 ∈ USGraph → ((𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph) ↔ (UnivVtx‘𝐺) = 𝑉)) |
6 | 1, 5 | bitrid 283 | 1 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ (UnivVtx‘𝐺) = 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ‘cfv 6563 Vtxcvtx 29028 USGraphcusgr 29181 UnivVtxcuvtx 29417 ComplGraphccplgr 29441 ComplUSGraphccusgr 29442 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-iota 6516 df-fv 6571 df-cplgr 29443 df-cusgr 29444 |
This theorem is referenced by: vdiscusgrb 29563 vdiscusgr 29564 |
Copyright terms: Public domain | W3C validator |