Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wlk2v2e | Structured version Visualization version GIF version |
Description: In a graph with two vertices and one edge connecting these two vertices, to go from one vertex to the other and back to the first vertex via the same/only edge is a walk. Notice that 𝐺 is a simple graph (without loops) only if 𝑋 ≠ 𝑌. (Contributed by Alexander van der Vekens, 22-Oct-2017.) (Revised by AV, 8-Jan-2021.) |
Ref | Expression |
---|---|
wlk2v2e.i | ⊢ 𝐼 = 〈“{𝑋, 𝑌}”〉 |
wlk2v2e.f | ⊢ 𝐹 = 〈“00”〉 |
wlk2v2e.x | ⊢ 𝑋 ∈ V |
wlk2v2e.y | ⊢ 𝑌 ∈ V |
wlk2v2e.p | ⊢ 𝑃 = 〈“𝑋𝑌𝑋”〉 |
wlk2v2e.g | ⊢ 𝐺 = 〈{𝑋, 𝑌}, 𝐼〉 |
Ref | Expression |
---|---|
wlk2v2e | ⊢ 𝐹(Walks‘𝐺)𝑃 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlk2v2e.g | . . . . 5 ⊢ 𝐺 = 〈{𝑋, 𝑌}, 𝐼〉 | |
2 | wlk2v2e.i | . . . . . 6 ⊢ 𝐼 = 〈“{𝑋, 𝑌}”〉 | |
3 | 2 | opeq2i 4800 | . . . . 5 ⊢ 〈{𝑋, 𝑌}, 𝐼〉 = 〈{𝑋, 𝑌}, 〈“{𝑋, 𝑌}”〉〉 |
4 | 1, 3 | eqtri 2844 | . . . 4 ⊢ 𝐺 = 〈{𝑋, 𝑌}, 〈“{𝑋, 𝑌}”〉〉 |
5 | wlk2v2e.x | . . . . 5 ⊢ 𝑋 ∈ V | |
6 | wlk2v2e.y | . . . . 5 ⊢ 𝑌 ∈ V | |
7 | uspgr2v1e2w 27027 | . . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝑌 ∈ V) → 〈{𝑋, 𝑌}, 〈“{𝑋, 𝑌}”〉〉 ∈ USPGraph) | |
8 | 5, 6, 7 | mp2an 690 | . . . 4 ⊢ 〈{𝑋, 𝑌}, 〈“{𝑋, 𝑌}”〉〉 ∈ USPGraph |
9 | 4, 8 | eqeltri 2909 | . . 3 ⊢ 𝐺 ∈ USPGraph |
10 | uspgrupgr 26955 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph) | |
11 | 9, 10 | ax-mp 5 | . 2 ⊢ 𝐺 ∈ UPGraph |
12 | wlk2v2e.f | . . . . 5 ⊢ 𝐹 = 〈“00”〉 | |
13 | 2, 12 | wlk2v2elem1 27928 | . . . 4 ⊢ 𝐹 ∈ Word dom 𝐼 |
14 | wlk2v2e.p | . . . . . . . 8 ⊢ 𝑃 = 〈“𝑋𝑌𝑋”〉 | |
15 | 5 | prid1 4691 | . . . . . . . . 9 ⊢ 𝑋 ∈ {𝑋, 𝑌} |
16 | 6 | prid2 4692 | . . . . . . . . 9 ⊢ 𝑌 ∈ {𝑋, 𝑌} |
17 | s3cl 14235 | . . . . . . . . 9 ⊢ ((𝑋 ∈ {𝑋, 𝑌} ∧ 𝑌 ∈ {𝑋, 𝑌} ∧ 𝑋 ∈ {𝑋, 𝑌}) → 〈“𝑋𝑌𝑋”〉 ∈ Word {𝑋, 𝑌}) | |
18 | 15, 16, 15, 17 | mp3an 1457 | . . . . . . . 8 ⊢ 〈“𝑋𝑌𝑋”〉 ∈ Word {𝑋, 𝑌} |
19 | 14, 18 | eqeltri 2909 | . . . . . . 7 ⊢ 𝑃 ∈ Word {𝑋, 𝑌} |
20 | wrdf 13860 | . . . . . . 7 ⊢ (𝑃 ∈ Word {𝑋, 𝑌} → 𝑃:(0..^(♯‘𝑃))⟶{𝑋, 𝑌}) | |
21 | 19, 20 | ax-mp 5 | . . . . . 6 ⊢ 𝑃:(0..^(♯‘𝑃))⟶{𝑋, 𝑌} |
22 | 14 | fveq2i 6667 | . . . . . . . . 9 ⊢ (♯‘𝑃) = (♯‘〈“𝑋𝑌𝑋”〉) |
23 | s3len 14250 | . . . . . . . . 9 ⊢ (♯‘〈“𝑋𝑌𝑋”〉) = 3 | |
24 | 22, 23 | eqtr2i 2845 | . . . . . . . 8 ⊢ 3 = (♯‘𝑃) |
25 | 24 | oveq2i 7161 | . . . . . . 7 ⊢ (0..^3) = (0..^(♯‘𝑃)) |
26 | 25 | feq2i 6500 | . . . . . 6 ⊢ (𝑃:(0..^3)⟶{𝑋, 𝑌} ↔ 𝑃:(0..^(♯‘𝑃))⟶{𝑋, 𝑌}) |
27 | 21, 26 | mpbir 233 | . . . . 5 ⊢ 𝑃:(0..^3)⟶{𝑋, 𝑌} |
28 | 12 | fveq2i 6667 | . . . . . . . . 9 ⊢ (♯‘𝐹) = (♯‘〈“00”〉) |
29 | s2len 14245 | . . . . . . . . 9 ⊢ (♯‘〈“00”〉) = 2 | |
30 | 28, 29 | eqtri 2844 | . . . . . . . 8 ⊢ (♯‘𝐹) = 2 |
31 | 30 | oveq2i 7161 | . . . . . . 7 ⊢ (0...(♯‘𝐹)) = (0...2) |
32 | 3z 12009 | . . . . . . . . 9 ⊢ 3 ∈ ℤ | |
33 | fzoval 13033 | . . . . . . . . 9 ⊢ (3 ∈ ℤ → (0..^3) = (0...(3 − 1))) | |
34 | 32, 33 | ax-mp 5 | . . . . . . . 8 ⊢ (0..^3) = (0...(3 − 1)) |
35 | 3m1e2 11759 | . . . . . . . . 9 ⊢ (3 − 1) = 2 | |
36 | 35 | oveq2i 7161 | . . . . . . . 8 ⊢ (0...(3 − 1)) = (0...2) |
37 | 34, 36 | eqtr2i 2845 | . . . . . . 7 ⊢ (0...2) = (0..^3) |
38 | 31, 37 | eqtri 2844 | . . . . . 6 ⊢ (0...(♯‘𝐹)) = (0..^3) |
39 | 38 | feq2i 6500 | . . . . 5 ⊢ (𝑃:(0...(♯‘𝐹))⟶{𝑋, 𝑌} ↔ 𝑃:(0..^3)⟶{𝑋, 𝑌}) |
40 | 27, 39 | mpbir 233 | . . . 4 ⊢ 𝑃:(0...(♯‘𝐹))⟶{𝑋, 𝑌} |
41 | 2, 12, 5, 6, 14 | wlk2v2elem2 27929 | . . . 4 ⊢ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} |
42 | 13, 40, 41 | 3pm3.2i 1335 | . . 3 ⊢ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶{𝑋, 𝑌} ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}) |
43 | 1 | fveq2i 6667 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘〈{𝑋, 𝑌}, 𝐼〉) |
44 | prex 5324 | . . . . . 6 ⊢ {𝑋, 𝑌} ∈ V | |
45 | s1cli 13953 | . . . . . . 7 ⊢ 〈“{𝑋, 𝑌}”〉 ∈ Word V | |
46 | 2, 45 | eqeltri 2909 | . . . . . 6 ⊢ 𝐼 ∈ Word V |
47 | opvtxfv 26783 | . . . . . 6 ⊢ (({𝑋, 𝑌} ∈ V ∧ 𝐼 ∈ Word V) → (Vtx‘〈{𝑋, 𝑌}, 𝐼〉) = {𝑋, 𝑌}) | |
48 | 44, 46, 47 | mp2an 690 | . . . . 5 ⊢ (Vtx‘〈{𝑋, 𝑌}, 𝐼〉) = {𝑋, 𝑌} |
49 | 43, 48 | eqtr2i 2845 | . . . 4 ⊢ {𝑋, 𝑌} = (Vtx‘𝐺) |
50 | 1 | fveq2i 6667 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘〈{𝑋, 𝑌}, 𝐼〉) |
51 | opiedgfv 26786 | . . . . . 6 ⊢ (({𝑋, 𝑌} ∈ V ∧ 𝐼 ∈ Word V) → (iEdg‘〈{𝑋, 𝑌}, 𝐼〉) = 𝐼) | |
52 | 44, 46, 51 | mp2an 690 | . . . . 5 ⊢ (iEdg‘〈{𝑋, 𝑌}, 𝐼〉) = 𝐼 |
53 | 50, 52 | eqtr2i 2845 | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) |
54 | 49, 53 | upgriswlk 27416 | . . 3 ⊢ (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶{𝑋, 𝑌} ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
55 | 42, 54 | mpbiri 260 | . 2 ⊢ (𝐺 ∈ UPGraph → 𝐹(Walks‘𝐺)𝑃) |
56 | 11, 55 | ax-mp 5 | 1 ⊢ 𝐹(Walks‘𝐺)𝑃 |
Colors of variables: wff setvar class |
Syntax hints: ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∀wral 3138 Vcvv 3494 {cpr 4562 〈cop 4566 class class class wbr 5058 dom cdm 5549 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 0cc0 10531 1c1 10532 + caddc 10534 − cmin 10864 2c2 11686 3c3 11687 ℤcz 11975 ...cfz 12886 ..^cfzo 13027 ♯chash 13684 Word cword 13855 〈“cs1 13943 〈“cs2 14197 〈“cs3 14198 Vtxcvtx 26775 iEdgciedg 26776 UPGraphcupgr 26859 USPGraphcuspgr 26927 Walkscwlks 27372 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-dju 9324 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-fz 12887 df-fzo 13028 df-hash 13685 df-word 13856 df-concat 13917 df-s1 13944 df-s2 14204 df-s3 14205 df-vtx 26777 df-iedg 26778 df-edg 26827 df-uhgr 26837 df-upgr 26861 df-uspgr 26929 df-wlks 27375 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |