| 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 4692 | . . . . 5 ⊢ {𝑋, 𝑈} = {𝑈, 𝑋} | |
| 11 | s1eq 14615 | . . . . 5 ⊢ ({𝑋, 𝑈} = {𝑈, 𝑋} → 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉 |
| 13 | 12 | oveq2i 7408 | . . 3 ⊢ (𝐼 ++ 〈“{𝑋, 𝑈}”〉) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 14 | 9, 13 | eqtri 2786 | . 2 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 14 | vdegp1bi 29739 | 1 ⊢ ((VtxDeg‘𝐹)‘𝑈) = (𝑃 + 1) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1561 ∈ wcel 2143 ≠ wne 2958 {crab 3415 ∖ cdif 3902 ∅c0 4286 𝒫 cpw 4556 {csn 4583 {cpr 4585 class class class wbr 5101 ‘cfv 6522 (class class class)co 7397 1c1 11075 + caddc 11077 ≤ cle 11218 2c2 12273 ♯chash 14344 Word cword 14527 ++ cconcat 14584 〈“cs1 14610 Vtxcvtx 29198 iEdgciedg 29199 VtxDegcvtxdg 29667 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 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 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-1o 8438 df-oadd 8442 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-dju 9860 df-card 9898 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-nn 12212 df-2 12281 df-n0 12483 df-xnn0 12556 df-z 12570 df-uz 12841 df-xadd 13116 df-fz 13514 df-fzo 13661 df-hash 14345 df-word 14528 df-concat 14585 df-s1 14611 df-vtx 29200 df-iedg 29201 df-vtxdg 29668 |
| This theorem is referenced by: konigsberglem2 30456 konigsberglem3 30457 |
| Copyright terms: Public domain | W3C validator |