| 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 29601 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑈) = (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸})) |
| 4 | 3 | eqeq1d 2738 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑈 ∈ 𝑉) → (((VtxDeg‘𝐺)‘𝑈) = 0 ↔ (♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0)) |
| 5 | 1 | fvexi 6854 | . . . . 5 ⊢ 𝑉 ∈ V |
| 6 | 5 | rabex 5280 | . . . 4 ⊢ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V |
| 7 | hasheq0 14325 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} ∈ V → ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅)) | |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ ((♯‘{𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸}) = 0 ↔ {𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅) |
| 9 | rabeq0 4328 | . . . 4 ⊢ ({𝑣 ∈ 𝑉 ∣ {𝑈, 𝑣} ∈ 𝐸} = ∅ ↔ ∀𝑣 ∈ 𝑉 ¬ {𝑈, 𝑣} ∈ 𝐸) | |
| 10 | ralnex 3063 | . . . . . 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 1542 ∈ wcel 2114 ∀wral 3051 ∃wrex 3061 {crab 3389 Vcvv 3429 ∅c0 4273 {cpr 4569 ‘cfv 6498 0cc0 11038 ♯chash 14292 Vtxcvtx 29065 Edgcedg 29116 USGraphcusgr 29218 VtxDegcvtxdg 29534 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-oadd 8409 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-xadd 13064 df-fz 13462 df-hash 14293 df-edg 29117 df-uhgr 29127 df-ushgr 29128 df-upgr 29151 df-umgr 29152 df-uspgr 29219 df-usgr 29220 df-nbgr 29402 df-vtxdg 29535 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |