| 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 30202 | . . . 4 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ (1st ‘𝑊)(Walks‘𝐺)(2nd ‘𝑊)) | |
| 2 | upgrwlkcompim.1 | . . . . 5 ⊢ 𝐹 = (1st ‘𝑊) | |
| 3 | upgrwlkcompim.2 | . . . . 5 ⊢ 𝑃 = (2nd ‘𝑊) | |
| 4 | 2, 3 | breq12i 5112 | . . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 ↔ (1st ‘𝑊)(Walks‘𝐺)(2nd ‘𝑊)) |
| 5 | 1, 4 | bitr4i 281 | . . 3 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ 𝐹(Walks‘𝐺)𝑃) |
| 6 | upgrwlkcompim.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 7 | upgrwlkcompim.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | 6, 7 | upgriswlk 30214 | . . . 4 ⊢ (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
| 9 | 8 | biimpd 232 | . . 3 ⊢ (𝐺 ∈ UPGraph → (𝐹(Walks‘𝐺)𝑃 → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
| 10 | 5, 9 | biimtrid 245 | . 2 ⊢ (𝐺 ∈ UPGraph → (𝑊 ∈ (Walks‘𝐺) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))}))) |
| 11 | 10 | imp 412 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑊 ∈ (Walks‘𝐺)) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3077 {cpr 4586 class class class wbr 5103 dom cdm 5651 ⟶wf 6533 ‘cfv 6537 (class class class)co 7418 1st c1st 7997 2nd c2nd 7998 0cc0 11193 1c1 11194 + caddc 11196 ...cfz 13632 ..^cfzo 13781 ♯chash 14467 Word cword 14651 Vtxcvtx 29567 iEdgciedg 29568 UPGraphcupgr 29651 Walkscwlks 30170 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-2o 8470 df-oadd 8473 df-er 8710 df-map 8842 df-pm 8843 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-dju 9975 df-card 10013 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-n0 12600 df-xnn0 12673 df-z 12687 df-uz 12959 df-fz 13633 df-fzo 13782 df-hash 14468 df-word 14652 df-edg 29619 df-uhgr 29629 df-upgr 29653 df-wlks 30173 |
| This theorem is used by: uspgr2wlkeq 30219 upgrclwlkcompim 30361 |
| Copyright terms: Public domain | W3C validator |