![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > upgrwlkcompim | Structured version Visualization version GIF version |
Description: Implications for the properties of the components of a walk in a pseudograph. (Contributed by Alexander van der Vekens, 23-Jun-2018.) (Revised by AV, 14-Apr-2021.) |
Ref | Expression |
---|---|
upgrwlkcompim.v | ⊢ 𝑉 = (Vtx‘𝐺) |
upgrwlkcompim.i | ⊢ 𝐼 = (iEdg‘𝐺) |
upgrwlkcompim.1 | ⊢ 𝐹 = (1st ‘𝑊) |
upgrwlkcompim.2 | ⊢ 𝑃 = (2nd ‘𝑊) |
Ref | Expression |
---|---|
upgrwlkcompim | ⊢ ((𝐺 ∈ UPGraph ∧ 𝑊 ∈ (Walks‘𝐺)) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wlkcpr 28524 | . . . 4 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ (1st ‘𝑊)(Walks‘𝐺)(2nd ‘𝑊)) | |
2 | upgrwlkcompim.1 | . . . . 5 ⊢ 𝐹 = (1st ‘𝑊) | |
3 | upgrwlkcompim.2 | . . . . 5 ⊢ 𝑃 = (2nd ‘𝑊) | |
4 | 2, 3 | breq12i 5114 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 ↔ (1st ‘𝑊)(Walks‘𝐺)(2nd ‘𝑊)) |
5 | 1, 4 | bitr4i 277 | . . 3 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ 𝐹(Walks‘𝐺)𝑃) |
6 | upgrwlkcompim.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
7 | upgrwlkcompim.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
8 | 6, 7 | upgriswlk 28536 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
9 | 8 | biimpd 228 | . . 3 ⊢ (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
10 | 5, 9 | biimtrid 241 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝑊 ∈ (Walks‘𝐺) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
11 | 10 | imp 407 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑊 ∈ (Walks‘𝐺)) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3064 {cpr 4588 class class class wbr 5105 dom cdm 5633 ⟶wf 6492 ‘cfv 6496 (class class class)co 7356 1st c1st 7918 2nd c2nd 7919 0cc0 11050 1c1 11051 + caddc 11053 ...cfz 13423 ..^cfzo 13566 ♯chash 14229 Word cword 14401 Vtxcvtx 27894 iEdgciedg 27895 UPGraphcupgr 27978 Walkscwlks 28491 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-cnex 11106 ax-resscn 11107 ax-1cn 11108 ax-icn 11109 ax-addcl 11110 ax-addrcl 11111 ax-mulcl 11112 ax-mulrcl 11113 ax-mulcom 11114 ax-addass 11115 ax-mulass 11116 ax-distr 11117 ax-i2m1 11118 ax-1ne0 11119 ax-1rid 11120 ax-rnegex 11121 ax-rrecex 11122 ax-cnre 11123 ax-pre-lttri 11124 ax-pre-lttrn 11125 ax-pre-ltadd 11126 ax-pre-mulgt0 11127 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ifp 1062 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-1st 7920 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-1o 8411 df-2o 8412 df-oadd 8415 df-er 8647 df-map 8766 df-pm 8767 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-dju 9836 df-card 9874 df-pnf 11190 df-mnf 11191 df-xr 11192 df-ltxr 11193 df-le 11194 df-sub 11386 df-neg 11387 df-nn 12153 df-2 12215 df-n0 12413 df-xnn0 12485 df-z 12499 df-uz 12763 df-fz 13424 df-fzo 13567 df-hash 14230 df-word 14402 df-edg 27946 df-uhgr 27956 df-upgr 27980 df-wlks 28494 |
This theorem is referenced by: uspgr2wlkeq 28541 upgrclwlkcompim 28676 |
Copyright terms: Public domain | W3C validator |