| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vdegp1ci | Structured version Visualization version GIF version | ||
| Description: The induction step for a vertex degree calculation, for example in the Königsberg graph. If the degree of 𝑈 in the edge set 𝐸 is 𝑃, then adding {𝑋, 𝑈} to the edge set, where 𝑋 ≠ 𝑈, yields degree 𝑃 + 1. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 3-Mar-2021.) |
| Ref | Expression |
|---|---|
| vdegp1ai.vg | ⊢ 𝑉 = (Vtx‘𝐺) |
| vdegp1ai.u | ⊢ 𝑈 ∈ 𝑉 |
| vdegp1ai.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| vdegp1ai.w | ⊢ 𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} |
| vdegp1ai.d | ⊢ ((VtxDeg‘𝐺)‘𝑈) = 𝑃 |
| vdegp1ai.vf | ⊢ (Vtx‘𝐹) = 𝑉 |
| vdegp1bi.x | ⊢ 𝑋 ∈ 𝑉 |
| vdegp1bi.xu | ⊢ 𝑋 ≠ 𝑈 |
| vdegp1ci.f | ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑋, 𝑈}”〉) |
| Ref | Expression |
|---|---|
| vdegp1ci | ⊢ ((VtxDeg‘𝐹)‘𝑈) = (𝑃 + 1) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vdegp1ai.vg | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | vdegp1ai.u | . 2 ⊢ 𝑈 ∈ 𝑉 | |
| 3 | vdegp1ai.i | . 2 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | vdegp1ai.w | . 2 ⊢ 𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} | |
| 5 | vdegp1ai.d | . 2 ⊢ ((VtxDeg‘𝐺)‘𝑈) = 𝑃 | |
| 6 | vdegp1ai.vf | . 2 ⊢ (Vtx‘𝐹) = 𝑉 | |
| 7 | vdegp1bi.x | . 2 ⊢ 𝑋 ∈ 𝑉 | |
| 8 | vdegp1bi.xu | . 2 ⊢ 𝑋 ≠ 𝑈 | |
| 9 | vdegp1ci.f | . . 3 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑋, 𝑈}”〉) | |
| 10 | prcom 4698 | . . . . 5 ⊢ {𝑋, 𝑈} = {𝑈, 𝑋} | |
| 11 | s1eq 14571 | . . . . 5 ⊢ ({𝑋, 𝑈} = {𝑈, 𝑋} → 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉 |
| 13 | 12 | oveq2i 7400 | . . 3 ⊢ (𝐼 ++ 〈“{𝑋, 𝑈}”〉) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 14 | 9, 13 | eqtri 2753 | . 2 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 14 | vdegp1bi 29471 | 1 ⊢ ((VtxDeg‘𝐹)‘𝑈) = (𝑃 + 1) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ∈ wcel 2109 ≠ wne 2926 {crab 3408 ∖ cdif 3913 ∅c0 4298 𝒫 cpw 4565 {csn 4591 {cpr 4593 class class class wbr 5109 ‘cfv 6513 (class class class)co 7389 1c1 11075 + caddc 11077 ≤ cle 11215 2c2 12242 ♯chash 14301 Word cword 14484 ++ cconcat 14541 〈“cs1 14566 Vtxcvtx 28929 iEdgciedg 28930 VtxDegcvtxdg 29399 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-oadd 8440 df-er 8673 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-dju 9860 df-card 9898 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-nn 12188 df-2 12250 df-n0 12449 df-xnn0 12522 df-z 12536 df-uz 12800 df-xadd 13079 df-fz 13475 df-fzo 13622 df-hash 14302 df-word 14485 df-concat 14542 df-s1 14567 df-vtx 28931 df-iedg 28932 df-vtxdg 29400 |
| This theorem is referenced by: konigsberglem2 30188 konigsberglem3 30189 |
| Copyright terms: Public domain | W3C validator |