| 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 29683 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) | |
| 2 | hashnbusgrvd.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 2 | cusgruvtxb 29783 | . . . . 5 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ (UnivVtx‘𝐺) = 𝑉)) |
| 4 | 2 | uvtxssvtx 29751 | . . . . . 6 ⊢ (UnivVtx‘𝐺) ⊆ 𝑉 |
| 5 | eqcom 2769 | . . . . . . 7 ⊢ ((UnivVtx‘𝐺) = 𝑉 ↔ 𝑉 = (UnivVtx‘𝐺)) | |
| 6 | sssseq 3954 | . . . . . . 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 3925 | . . . 4 ⊢ (𝑉 ⊆ (UnivVtx‘𝐺) ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺)) | |
| 11 | 9, 10 | bitrdi 290 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺))) |
| 12 | 1, 11 | syl 18 | . 2 ⊢ (𝐺 ∈ FinUSGraph → (𝐺 ∈ ComplUSGraph ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘𝐺))) |
| 13 | 2 | usgruvtxvdb 29890 | . . 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 1569 ∈ wcel 2142 ∀wral 3078 ⊆ wss 3904 ‘cfv 6536 (class class class)co 7412 1c1 11107 − cmin 11447 ♯chash 14373 Vtxcvtx 29357 USGraphcusgr 29510 FinUSGraphcfusgr 29677 UnivVtxcuvtx 29746 ComplUSGraphccusgr 29771 VtxDegcvtxdg 29826 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-oadd 8455 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-n0 12511 df-xnn0 12584 df-z 12598 df-uz 12869 df-xadd 13144 df-fz 13542 df-hash 14374 df-edg 29409 df-uhgr 29419 df-ushgr 29420 df-upgr 29443 df-umgr 29444 df-uspgr 29511 df-usgr 29512 df-fusgr 29678 df-nbgr 29694 df-uvtx 29747 df-cplgr 29772 df-cusgr 29773 df-vtxdg 29827 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |