| 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 29915 | . . . 4 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ (1st ‘𝑊)(Walks‘𝐺)(2nd ‘𝑊)) | |
| 2 | upgrwlkcompim.1 | . . . . 5 ⊢ 𝐹 = (1st ‘𝑊) | |
| 3 | upgrwlkcompim.2 | . . . . 5 ⊢ 𝑃 = (2nd ‘𝑊) | |
| 4 | 2, 3 | breq12i 5119 | . . . 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 29927 | . . . 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 411 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑊 ∈ (Walks‘𝐺)) → (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))(𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 {cpr 4593 class class class wbr 5110 dom cdm 5659 ⟶wf 6529 ‘cfv 6533 (class class class)co 7408 1st c1st 7980 2nd c2nd 7981 0cc0 11096 1c1 11097 + caddc 11099 ...cfz 13531 ..^cfzo 13678 ♯chash 14362 Word cword 14546 Vtxcvtx 29283 iEdgciedg 29284 UPGraphcupgr 29367 Walkscwlks 29883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-ifp 1077 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-oadd 8453 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-n0 12501 df-xnn0 12574 df-z 12588 df-uz 12859 df-fz 13532 df-fzo 13679 df-hash 14363 df-word 14547 df-edg 29335 df-uhgr 29345 df-upgr 29369 df-wlks 29886 |
| This theorem is referenced by: uspgr2wlkeq 29932 upgrclwlkcompim 30067 |
| Copyright terms: Public domain | W3C validator |