| 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 4691 | . . . . 5 ⊢ {𝑋, 𝑈} = {𝑈, 𝑋} | |
| 11 | s1eq 14536 | . . . . 5 ⊢ ({𝑋, 𝑈} = {𝑈, 𝑋} → 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉) | |
| 12 | 10, 11 | ax-mp 5 | . . . 4 ⊢ 〈“{𝑋, 𝑈}”〉 = 〈“{𝑈, 𝑋}”〉 |
| 13 | 12 | oveq2i 7379 | . . 3 ⊢ (𝐼 ++ 〈“{𝑋, 𝑈}”〉) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 14 | 9, 13 | eqtri 2760 | . 2 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑈, 𝑋}”〉) |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 14 | vdegp1bi 29627 | 1 ⊢ ((VtxDeg‘𝐹)‘𝑈) = (𝑃 + 1) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ≠ wne 2933 {crab 3401 ∖ cdif 3900 ∅c0 4287 𝒫 cpw 4556 {csn 4582 {cpr 4584 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 1c1 11039 + caddc 11041 ≤ cle 11179 2c2 12212 ♯chash 14265 Word cword 14448 ++ cconcat 14505 〈“cs1 14531 Vtxcvtx 29085 iEdgciedg 29086 VtxDegcvtxdg 29555 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-dju 9825 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 df-xnn0 12487 df-z 12501 df-uz 12764 df-xadd 13039 df-fz 13436 df-fzo 13583 df-hash 14266 df-word 14449 df-concat 14506 df-s1 14532 df-vtx 29087 df-iedg 29088 df-vtxdg 29556 |
| This theorem is referenced by: konigsberglem2 30344 konigsberglem3 30345 |
| Copyright terms: Public domain | W3C validator |