| 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 3921 | . . . 4 ⊢ (𝜑 → ¬ 𝐾 ∈ {𝑁}) |
| 3 | 1loopgruspgr.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 4 | snex 5415 | . . . . . 6 ⊢ {𝑁} ∈ V | |
| 5 | fvsng 7185 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ {𝑁} ∈ V) → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) | |
| 6 | 3, 4, 5 | sylancl 598 | . . . . 5 ⊢ (𝜑 → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) |
| 7 | 6 | eleq2d 2852 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴) ↔ 𝐾 ∈ {𝑁})) |
| 8 | 2, 7 | mtbird 328 | . . 3 ⊢ (𝜑 → ¬ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴)) |
| 9 | 1loopgruspgr.i | . . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝑁}〉}) | |
| 10 | 9 | dmeqd 5900 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, {𝑁}〉}) |
| 11 | dmsnopg 6219 | . . . . . . 7 ⊢ ({𝑁} ∈ V → dom {〈𝐴, {𝑁}〉} = {𝐴}) | |
| 12 | 4, 11 | mp1i 14 | . . . . . 6 ⊢ (𝜑 → dom {〈𝐴, {𝑁}〉} = {𝐴}) |
| 13 | 10, 12 | eqtrd 2801 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
| 14 | 9 | fveq1d 6890 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝑖)) |
| 15 | 14 | eleq2d 2852 | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
| 16 | 13, 15 | rexeqbidv 3342 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ ∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
| 17 | fveq2 6888 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → ({〈𝐴, {𝑁}〉}‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝐴)) | |
| 18 | 17 | eleq2d 2852 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
| 19 | 18 | rexsng 4647 | . . . . 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 3920 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
| 24 | 1loopgruspgr.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
| 25 | 24 | eleq2d 2852 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ (Vtx‘𝐺) ↔ 𝐾 ∈ 𝑉)) |
| 26 | 23, 25 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (Vtx‘𝐺)) |
| 27 | eqid 2766 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 28 | eqid 2766 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 29 | eqid 2766 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 30 | 27, 28, 29 | vtxd0nedgb 29875 | . . 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 2146 ∃wrex 3092 Vcvv 3458 ∖ cdif 3905 {csn 4594 〈cop 4600 dom cdm 5666 ‘cfv 6543 0cc0 11118 Vtxcvtx 29383 iEdgciedg 29384 VtxDegcvtxdg 29852 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-n0 12523 df-xnn0 12596 df-z 12610 df-uz 12881 df-xadd 13156 df-fz 13554 df-hash 14387 df-vtxdg 29853 |
| This theorem is used by: 1egrvtxdg0 29898 eupth2lem3lem3 30618 |
| Copyright terms: Public domain | W3C validator |