| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1loopgrvd0 | Structured version Visualization version GIF version | ||
| Description: The vertex degree of a one-edge graph, case 1 (for a loop): a loop at a vertex other than the given vertex contributes nothing to the vertex degree. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 21-Feb-2021.) |
| Ref | Expression |
|---|---|
| 1loopgruspgr.v | ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) |
| 1loopgruspgr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| 1loopgruspgr.n | ⊢ (𝜑 → 𝑁 ∈ 𝑉) |
| 1loopgruspgr.i | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝑁}〉}) |
| 1loopgrvd0.k | ⊢ (𝜑 → 𝐾 ∈ (𝑉 ∖ {𝑁})) |
| Ref | Expression |
|---|---|
| 1loopgrvd0 | ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐾) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1loopgrvd0.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ (𝑉 ∖ {𝑁})) | |
| 2 | 1 | eldifbd 3915 | . . . 4 ⊢ (𝜑 → ¬ 𝐾 ∈ {𝑁}) |
| 3 | 1loopgruspgr.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 4 | snex 5408 | . . . . . 6 ⊢ {𝑁} ∈ V | |
| 5 | fvsng 7182 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ {𝑁} ∈ V) → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) | |
| 6 | 3, 4, 5 | sylancl 598 | . . . . 5 ⊢ (𝜑 → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) |
| 7 | 6 | eleq2d 2848 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴) ↔ 𝐾 ∈ {𝑁})) |
| 8 | 2, 7 | mtbird 328 | . . 3 ⊢ (𝜑 → ¬ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴)) |
| 9 | 1loopgruspgr.i | . . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝑁}〉}) | |
| 10 | 9 | dmeqd 5893 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, {𝑁}〉}) |
| 11 | dmsnopg 6213 | . . . . . . 7 ⊢ ({𝑁} ∈ V → dom {〈𝐴, {𝑁}〉} = {𝐴}) | |
| 12 | 4, 11 | mp1i 14 | . . . . . 6 ⊢ (𝜑 → dom {〈𝐴, {𝑁}〉} = {𝐴}) |
| 13 | 10, 12 | eqtrd 2797 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 14 | 9 | fveq1d 6884 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝑖)) |
| 15 | 14 | eleq2d 2848 | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
| 16 | 13, 15 | rexeqbidv 3337 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ ∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
| 17 | fveq2 6882 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → ({〈𝐴, {𝑁}〉}‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝐴)) | |
| 18 | 17 | eleq2d 2848 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
| 19 | 18 | rexsng 4640 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
| 20 | 3, 19 | syl 18 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
| 21 | 16, 20 | bitrd 282 | . . 3 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
| 22 | 8, 21 | mtbird 328 | . 2 ⊢ (𝜑 → ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖)) |
| 23 | 1 | eldifad 3914 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
| 24 | 1loopgruspgr.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 25 | 24 | eleq2d 2848 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ (Vtx‘𝐺) ↔ 𝐾 ∈ 𝑉)) |
| 26 | 23, 25 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (Vtx‘𝐺)) |
| 27 | eqid 2762 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 28 | eqid 2762 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 29 | eqid 2762 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 30 | 27, 28, 29 | vtxd0nedgb 29956 | . . 3 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
| 31 | 26, 30 | syl 18 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
| 32 | 22, 31 | mpbird 260 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐾) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∃wrex 3088 Vcvv 3453 ∖ cdif 3899 {csn 4587 〈cop 4593 dom cdm 5659 ‘cfv 6537 0cc0 11128 Vtxcvtx 29461 iEdgciedg 29462 VtxDegcvtxdg 29933 |
| 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 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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-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 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-card 9948 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-n0 12533 df-xnn0 12606 df-z 12620 df-uz 12892 df-xadd 13168 df-fz 13566 df-hash 14399 df-vtxdg 29934 |
| This theorem is used by: 1egrvtxdg0 29979 eupth2lem3lem3 30718 |
| Copyright terms: Public domain | W3C validator |