![]() |
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 3976 | . . . 4 ⊢ (𝜑 → ¬ 𝐾 ∈ {𝑁}) |
3 | 1loopgruspgr.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
4 | snex 5442 | . . . . . 6 ⊢ {𝑁} ∈ V | |
5 | fvsng 7200 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ {𝑁} ∈ V) → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) | |
6 | 3, 4, 5 | sylancl 586 | . . . . 5 ⊢ (𝜑 → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) |
7 | 6 | eleq2d 2825 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴) ↔ 𝐾 ∈ {𝑁})) |
8 | 2, 7 | mtbird 325 | . . 3 ⊢ (𝜑 → ¬ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴)) |
9 | 1loopgruspgr.i | . . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝑁}〉}) | |
10 | 9 | dmeqd 5919 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, {𝑁}〉}) |
11 | dmsnopg 6235 | . . . . . . 7 ⊢ ({𝑁} ∈ V → dom {〈𝐴, {𝑁}〉} = {𝐴}) | |
12 | 4, 11 | mp1i 13 | . . . . . 6 ⊢ (𝜑 → dom {〈𝐴, {𝑁}〉} = {𝐴}) |
13 | 10, 12 | eqtrd 2775 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
14 | 9 | fveq1d 6909 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝑖)) |
15 | 14 | eleq2d 2825 | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
16 | 13, 15 | rexeqbidv 3345 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ ∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
17 | fveq2 6907 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → ({〈𝐴, {𝑁}〉}‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝐴)) | |
18 | 17 | eleq2d 2825 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
19 | 18 | rexsng 4681 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
20 | 3, 19 | syl 17 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
21 | 16, 20 | bitrd 279 | . . 3 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
22 | 8, 21 | mtbird 325 | . 2 ⊢ (𝜑 → ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖)) |
23 | 1 | eldifad 3975 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
24 | 1loopgruspgr.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
25 | 24 | eleq2d 2825 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ (Vtx‘𝐺) ↔ 𝐾 ∈ 𝑉)) |
26 | 23, 25 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (Vtx‘𝐺)) |
27 | eqid 2735 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
28 | eqid 2735 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
29 | eqid 2735 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
30 | 27, 28, 29 | vtxd0nedgb 29521 | . . 3 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
31 | 26, 30 | syl 17 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
32 | 22, 31 | mpbird 257 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐾) = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 Vcvv 3478 ∖ cdif 3960 {csn 4631 〈cop 4637 dom cdm 5689 ‘cfv 6563 0cc0 11153 Vtxcvtx 29028 iEdgciedg 29029 VtxDegcvtxdg 29498 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-n0 12525 df-xnn0 12598 df-z 12612 df-uz 12877 df-xadd 13153 df-fz 13545 df-hash 14367 df-vtxdg 29499 |
This theorem is referenced by: 1egrvtxdg0 29544 eupth2lem3lem3 30259 |
Copyright terms: Public domain | W3C validator |