| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vdiscusgrb | Structured version Visualization version GIF version | ||
| Description: A finite simple graph with n vertices is complete iff every vertex has degree 𝑛 − 1. (Contributed by Alexander van der Vekens, 14-Jul-2018.) (Revised by AV, 22-Dec-2020.) |
| Ref | Expression |
|---|---|
| hashnbusgrvd.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| vdiscusgrb | ⊢ (𝐺 ∈ FinUSGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = ((♯‘𝑉) − 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fusgrusgr 29768 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) | |
| 2 | hashnbusgrvd.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 2 | cusgruvtxb 29868 | . . . . 5 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ (UnivVtx‘𝐺) = 𝑉)) |
| 4 | 2 | uvtxssvtx 29836 | . . . . . 6 ⊢ (UnivVtx‘𝐺) ⊆ 𝑉 |
| 5 | eqcom 2769 | . . . . . . 7 ⊢ ((UnivVtx‘𝐺) = 𝑉 ↔ 𝑉 = (UnivVtx‘𝐺)) | |
| 6 | sssseq 3952 | . . . . . . 7 ⊢ ((UnivVtx‘𝐺) ⊆ 𝑉 → (𝑉 ⊆ (UnivVtx‘𝐺) ↔ 𝑉 = (UnivVtx‘𝐺))) | |
| 7 | 5, 6 | bitr4id 293 | . . . . . 6 ⊢ ((UnivVtx‘𝐺) ⊆ 𝑉 → ((UnivVtx‘𝐺) = 𝑉 ↔ 𝑉 ⊆ (UnivVtx‘𝐺))) |
| 8 | 4, 7 | mp1i 14 | . . . . 5 ⊢ (𝐺 ∈ USGraph → ((UnivVtx‘𝐺) = 𝑉 ↔ 𝑉 ⊆ (UnivVtx‘𝐺))) |
| 9 | 3, 8 | bitrd 282 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ 𝑉 ⊆ (UnivVtx‘𝐺))) |
| 10 | dfss3 3923 | . . . 4 ⊢ (𝑉 ⊆ (UnivVtx‘𝐺) ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺)) | |
| 11 | 9, 10 | bitrdi 290 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺))) |
| 12 | 1, 11 | syl 18 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺))) |
| 13 | 2 | usgruvtxvdb 29975 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑣 ∈ 𝑉) → (𝑣 ∈ (UnivVtx‘𝐺) ↔ ((VtxDeg‘𝐺)‘𝑣) = ((♯‘𝑉) − 1))) |
| 14 | 13 | ralbidva 3185 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺) ↔ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = ((♯‘𝑉) − 1))) |
| 15 | 12, 14 | bitrd 282 | 1 ⊢ (𝐺 ∈ FinUSGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = ((♯‘𝑉) − 1))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ⊆ wss 3902 ‘cfv 6537 (class class class)co 7416 1c1 11128 − cmin 11468 ♯chash 14396 Vtxcvtx 29439 USGraphcusgr 29595 FinUSGraphcfusgr 29762 UnivVtxcuvtx 29831 ComplUSGraphccusgr 29856 VtxDegcvtxdg 29911 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-oadd 8462 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-n0 12532 df-xnn0 12605 df-z 12619 df-uz 12891 df-xadd 13166 df-fz 13564 df-hash 14397 df-edg 29491 df-uhgr 29501 df-ushgr 29502 df-upgr 29525 df-umgr 29526 df-uspgr 29596 df-usgr 29597 df-fusgr 29763 df-nbgr 29779 df-uvtx 29832 df-cplgr 29857 df-cusgr 29858 df-vtxdg 29912 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |