| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgrvd0nedg | Structured version Visualization version GIF version | ||
| Description: If a vertex in a simple graph has degree 0, the vertex is not adjacent to another vertex via an edge. (Contributed by Alexander van der Vekens, 20-Dec-2017.) (Revised by AV, 16-Dec-2020.) (Proof shortened by AV, 23-Dec-2020.) |
| Ref | Expression |
|---|---|
| vtxdusgradjvtx.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| vtxdusgradjvtx.e | ⊢ 𝐸 = (Edg‘𝐺) |
| Ref | Expression |
|---|---|
| usgrvd0nedg | ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vtxdusgradjvtx.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | vtxdusgradjvtx.e | . . . 4 ⊢ 𝐸 = (Edg‘𝐺) | |
| 3 | 1, 2 | vtxdusgradjvtx 29995 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑈) = (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸})) |
| 4 | 3 | eqeq1d 2762 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 ↔ (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0)) |
| 5 | 1 | fvexi 6893 | . . . . 5 ⊢ 𝑉 ∈ V |
| 6 | 5 | rabex 5303 | . . . 4 ⊢ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V |
| 7 | hasheq0 14430 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V → ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅)) | |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅) |
| 9 | rabeq0 4338 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸) | |
| 10 | ralnex 3088 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 ↔ ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸) | |
| 11 | 10 | biimpi 219 | . . . . 5 ⊢ (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸) |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 13 | 9, 12 | biimtrid 245 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅ → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 14 | 8, 13 | biimtrid 245 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 15 | 4, 14 | sylbid 243 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 {crab 3412 Vcvv 3450 ∅c0 4279 {cpr 4586 ‘cfv 6533 0cc0 11127 ♯chash 14397 Vtxcvtx 29456 Edgcedg 29507 USGraphcusgr 29612 VtxDegcvtxdg 29928 |
| 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 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 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 13167 df-fz 13565 df-hash 14398 df-edg 29508 df-uhgr 29518 df-ushgr 29519 df-upgr 29542 df-umgr 29543 df-uspgr 29613 df-usgr 29614 df-nbgr 29796 df-vtxdg 29929 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |