| 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 29608 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑈) = (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸})) |
| 4 | 3 | eqeq1d 2738 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 ↔ (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0)) |
| 5 | 1 | fvexi 6848 | . . . . 5 ⊢ 𝑉 ∈ V |
| 6 | 5 | rabex 5284 | . . . 4 ⊢ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V |
| 7 | hasheq0 14288 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V → ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅)) | |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅) |
| 9 | rabeq0 4340 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸) | |
| 10 | ralnex 3062 | . . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 ↔ ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸) | |
| 11 | 10 | biimpi 216 | . . . . 5 ⊢ (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸) |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 13 | 9, 12 | biimtrid 242 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅ → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 14 | 8, 13 | biimtrid 242 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| 15 | 4, 14 | sylbid 240 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 → ¬ ∃𝑣 ∈ 𝑉 {𝑈, 𝑣} ∈ 𝐸)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 {crab 3399 Vcvv 3440 ∅c0 4285 {cpr 4582 ‘cfv 6492 0cc0 11028 ♯chash 14255 Vtxcvtx 29071 Edgcedg 29122 USGraphcusgr 29224 VtxDegcvtxdg 29541 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-dju 9815 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-2 12210 df-n0 12404 df-xnn0 12477 df-z 12491 df-uz 12754 df-xadd 13029 df-fz 13426 df-hash 14256 df-edg 29123 df-uhgr 29133 df-ushgr 29134 df-upgr 29157 df-umgr 29158 df-uspgr 29225 df-usgr 29226 df-nbgr 29408 df-vtxdg 29542 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |