![]() |
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 5386 | . . . . . 6 ⊢ {𝑁} ∈ V | |
5 | fvsng 7122 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ {𝑁} ∈ V) → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) | |
6 | 3, 4, 5 | sylancl 586 | . . . . 5 ⊢ (𝜑 → ({〈𝐴, {𝑁}〉}‘𝐴) = {𝑁}) |
7 | 6 | eleq2d 2823 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴) ↔ 𝐾 ∈ {𝑁})) |
8 | 2, 7 | mtbird 324 | . . 3 ⊢ (𝜑 → ¬ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴)) |
9 | 1loopgruspgr.i | . . . . . . 7 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, {𝑁}〉}) | |
10 | 9 | dmeqd 5859 | . . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝐺) = dom {〈𝐴, {𝑁}〉}) |
11 | dmsnopg 6163 | . . . . . . 7 ⊢ ({𝑁} ∈ V → dom {〈𝐴, {𝑁}〉} = {𝐴}) | |
12 | 4, 11 | mp1i 13 | . . . . . 6 ⊢ (𝜑 → dom {〈𝐴, {𝑁}〉} = {𝐴}) |
13 | 10, 12 | eqtrd 2777 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝐺) = {𝐴}) |
14 | 9 | fveq1d 6841 | . . . . . 6 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝑖)) |
15 | 14 | eleq2d 2823 | . . . . 5 ⊢ (𝜑 → (𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
16 | 13, 15 | rexeqbidv 3318 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ ∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖))) |
17 | fveq2 6839 | . . . . . . 7 ⊢ (𝑖 = 𝐴 → ({〈𝐴, {𝑁}〉}‘𝑖) = ({〈𝐴, {𝑁}〉}‘𝐴)) | |
18 | 17 | eleq2d 2823 | . . . . . 6 ⊢ (𝑖 = 𝐴 → (𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
19 | 18 | rexsng 4633 | . . . . 5 ⊢ (𝐴 ∈ 𝑋 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
20 | 3, 19 | syl 17 | . . . 4 ⊢ (𝜑 → (∃𝑖 ∈ {𝐴}𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
21 | 16, 20 | bitrd 278 | . . 3 ⊢ (𝜑 → (∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖) ↔ 𝐾 ∈ ({〈𝐴, {𝑁}〉}‘𝐴))) |
22 | 8, 21 | mtbird 324 | . 2 ⊢ (𝜑 → ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖)) |
23 | 1 | eldifad 3920 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉) |
24 | 1loopgruspgr.v | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) = 𝑉) | |
25 | 24 | eleq2d 2823 | . . . 4 ⊢ (𝜑 → (𝐾 ∈ (Vtx‘𝐺) ↔ 𝐾 ∈ 𝑉)) |
26 | 23, 25 | mpbird 256 | . . 3 ⊢ (𝜑 → 𝐾 ∈ (Vtx‘𝐺)) |
27 | eqid 2737 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
28 | eqid 2737 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
29 | eqid 2737 | . . . 4 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
30 | 27, 28, 29 | vtxd0nedgb 28265 | . . 3 ⊢ (𝐾 ∈ (Vtx‘𝐺) → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
31 | 26, 30 | syl 17 | . 2 ⊢ (𝜑 → (((VtxDeg‘𝐺)‘𝐾) = 0 ↔ ¬ ∃𝑖 ∈ dom (iEdg‘𝐺)𝐾 ∈ ((iEdg‘𝐺)‘𝑖))) |
32 | 22, 31 | mpbird 256 | 1 ⊢ (𝜑 → ((VtxDeg‘𝐺)‘𝐾) = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ∃wrex 3071 Vcvv 3443 ∖ cdif 3905 {csn 4584 〈cop 4590 dom cdm 5631 ‘cfv 6493 0cc0 11009 Vtxcvtx 27776 iEdgciedg 27777 VtxDegcvtxdg 28242 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5240 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 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 6251 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7307 df-ov 7354 df-oprab 7355 df-mpo 7356 df-om 7795 df-1st 7913 df-2nd 7914 df-frecs 8204 df-wrecs 8235 df-recs 8309 df-rdg 8348 df-1o 8404 df-er 8606 df-en 8842 df-dom 8843 df-sdom 8844 df-fin 8845 df-card 9833 df-pnf 11149 df-mnf 11150 df-xr 11151 df-ltxr 11152 df-le 11153 df-sub 11345 df-neg 11346 df-nn 12112 df-n0 12372 df-xnn0 12444 df-z 12458 df-uz 12722 df-xadd 12988 df-fz 13379 df-hash 14185 df-vtxdg 28243 |
This theorem is referenced by: 1egrvtxdg0 28288 eupth2lem3lem3 29003 |
Copyright terms: Public domain | W3C validator |