| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vdegp1ai | Structured version Visualization version GIF version | ||
| Description: The induction step for a vertex degree calculation. If the degree of 𝑈 in the edge set 𝐸 is 𝑃, then adding {𝑋, 𝑌} to the edge set, where 𝑋 ≠ 𝑈 ≠ 𝑌, yields degree 𝑃 as well. (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‘𝐹) = 𝑉 |
| vdegp1ai.x | ⊢ 𝑋 ∈ 𝑉 |
| vdegp1ai.xu | ⊢ 𝑋 ≠ 𝑈 |
| vdegp1ai.y | ⊢ 𝑌 ∈ 𝑉 |
| vdegp1ai.yu | ⊢ 𝑌 ≠ 𝑈 |
| vdegp1ai.f | ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑋, 𝑌}”〉) |
| Ref | Expression |
|---|---|
| vdegp1ai | ⊢ ((VtxDeg‘𝐹)‘𝑈) = 𝑃 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prex 5402 | . . 3 ⊢ {𝑋, 𝑌} ∈ V | |
| 2 | vdegp1ai.vg | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | vdegp1ai.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 4 | vdegp1ai.w | . . . . 5 ⊢ 𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} | |
| 5 | wrdf 14703 | . . . . . 6 ⊢ (𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐼:(0..^(♯‘𝐼))⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) | |
| 6 | 5 | ffund 6743 | . . . . 5 ⊢ (𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → Fun 𝐼) |
| 7 | 4, 6 | mp1i 14 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → Fun 𝐼) |
| 8 | vdegp1ai.vf | . . . . 5 ⊢ (Vtx‘𝐹) = 𝑉 | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → (Vtx‘𝐹) = 𝑉) |
| 10 | vdegp1ai.f | . . . . 5 ⊢ (iEdg‘𝐹) = (𝐼 ++ 〈“{𝑋, 𝑌}”〉) | |
| 11 | wrdv 14714 | . . . . . . 7 ⊢ (𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → 𝐼 ∈ Word V) | |
| 12 | 4, 11 | ax-mp 5 | . . . . . 6 ⊢ 𝐼 ∈ Word V |
| 13 | cats1un 14911 | . . . . . 6 ⊢ ((𝐼 ∈ Word V ∧ {𝑋, 𝑌} ∈ V) → (𝐼 ++ 〈“{𝑋, 𝑌}”〉) = (𝐼 ∪ {〈(♯‘𝐼), {𝑋, 𝑌}〉})) | |
| 14 | 12, 13 | mpan 703 | . . . . 5 ⊢ ({𝑋, 𝑌} ∈ V → (𝐼 ++ 〈“{𝑋, 𝑌}”〉) = (𝐼 ∪ {〈(♯‘𝐼), {𝑋, 𝑌}〉})) |
| 15 | 10, 14 | eqtrid 2813 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → (iEdg‘𝐹) = (𝐼 ∪ {〈(♯‘𝐼), {𝑋, 𝑌}〉})) |
| 16 | fvexd 6930 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → (♯‘𝐼) ∈ V) | |
| 17 | wrdlndm 14715 | . . . . 5 ⊢ (𝐼 ∈ Word {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (♯‘𝐼) ∉ dom 𝐼) | |
| 18 | 4, 17 | mp1i 14 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → (♯‘𝐼) ∉ dom 𝐼) |
| 19 | vdegp1ai.u | . . . . 5 ⊢ 𝑈 ∈ 𝑉 | |
| 20 | 19 | a1i 11 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → 𝑈 ∈ 𝑉) |
| 21 | id 23 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → {𝑋, 𝑌} ∈ V) | |
| 22 | vdegp1ai.xu | . . . . . . 7 ⊢ 𝑋 ≠ 𝑈 | |
| 23 | 22 | necomi 3016 | . . . . . 6 ⊢ 𝑈 ≠ 𝑋 |
| 24 | vdegp1ai.yu | . . . . . . 7 ⊢ 𝑌 ≠ 𝑈 | |
| 25 | 24 | necomi 3016 | . . . . . 6 ⊢ 𝑈 ≠ 𝑌 |
| 26 | 23, 25 | prneli 4617 | . . . . 5 ⊢ 𝑈 ∉ {𝑋, 𝑌} |
| 27 | 26 | a1i 11 | . . . 4 ⊢ ({𝑋, 𝑌} ∈ V → 𝑈 ∉ {𝑋, 𝑌}) |
| 28 | 2, 3, 7, 9, 15, 16, 18, 20, 21, 27 | p1evtxdeq 30153 | . . 3 ⊢ ({𝑋, 𝑌} ∈ V → ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈)) |
| 29 | 1, 28 | ax-mp 5 | . 2 ⊢ ((VtxDeg‘𝐹)‘𝑈) = ((VtxDeg‘𝐺)‘𝑈) |
| 30 | vdegp1ai.d | . 2 ⊢ ((VtxDeg‘𝐺)‘𝑈) = 𝑃 | |
| 31 | 29, 30 | eqtri 2789 | 1 ⊢ ((VtxDeg‘𝐹)‘𝑈) = 𝑃 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∉ wnel 3068 {crab 3415 Vcvv 3453 ∖ cdif 4047 ∪ cun 4151 ∅c0 4280 𝒫 cpw 4559 {csn 4587 {cpr 4589 〈cop 4839 class class class wbr 5107 dom cdm 5657 Fun wfun 6559 ‘cfv 6565 (class class class)co 7450 0cc0 11238 ≤ cle 11382 2c2 12436 ..^cfzo 13827 ♯chash 14514 Word cword 14698 ++ cconcat 14755 〈“cs1 14782 Vtxcvtx 29633 iEdgciedg 29634 VtxDegcvtxdg 30105 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-oadd 8517 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-xadd 13281 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-vtx 29635 df-iedg 29636 df-vtxdg 30106 |
| This theorem is used by: konigsberglem1 30912 konigsberglem2 30913 konigsberglem3 30914 |
| Copyright terms: Public domain | W3C validator |