| 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 4693 | . . . . 5 ⊢ {𝑋, 𝑈} = {𝑈, 𝑋} | |
| 11 | s1eq 14760 | . . . . 5 ⊢ ({𝑋, 𝑈} = {𝑈, 𝑋} → 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉 |
| 13 | 12 | oveq2i 7441 | . . 3 ⊢ (𝐼 ++ 〈“{𝑋, 𝑈}”〉) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 14 | 9, 13 | eqtri 2786 | . 2 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 14 | vdegp1bi 30133 | 1 ⊢ ((VtxDeg‘𝐹)‘𝑈) = (𝑃 + 1) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2146 ≠ wne 2959 {crab 3416 ∖ cdif 4048 ∅c0 4281 𝒫 cpw 4560 {csn 4588 {cpr 4590 class class class wbr 5106 ‘cfv 6547 (class class class)co 7430 1c1 11214 + caddc 11216 ≤ cle 11357 2c2 12410 ♯chash 14487 Word cword 14671 ++ cconcat 14728 〈“cs1 14755 Vtxcvtx 29589 iEdgciedg 29590 VtxDegcvtxdg 30061 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7888 df-1st 8011 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-1o 8490 df-oadd 8494 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-dju 9995 df-card 10033 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-nn 12349 df-2 12418 df-n0 12620 df-xnn0 12693 df-z 12707 df-uz 12979 df-xadd 13255 df-fz 13653 df-fzo 13802 df-hash 14488 df-word 14672 df-concat 14729 df-s1 14756 df-vtx 29591 df-iedg 29592 df-vtxdg 30062 |
| This theorem is used by: konigsberglem2 30869 konigsberglem3 30870 |
| Copyright terms: Public domain | W3C validator |