wlkcomp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > wlkcomp		Structured version Visualization version GIF version

Theorem wlkcomp 28753

Description: A walk expressed by properties of its components. (Contributed by Alexander van der Vekens, 23-Jun-2018.) (Revised by AV, 1-Jan-2021.)

**Hypotheses**
Ref	Expression
wlkcomp.v	⊢ 𝑉 = (Vtx‘𝐺)
wlkcomp.i	⊢ 𝐼 = (iEdg‘𝐺)
wlkcomp.1	⊢ 𝐹 = (1^st ‘𝑊)
wlkcomp.2	⊢ 𝑃 = (2^nd ‘𝑊)

**Assertion**
Ref	Expression
wlkcomp	⊢ ((𝐺 ∈ 𝑈 ∧ 𝑊 ∈ (𝑆 × 𝑇)) → (𝑊 ∈ (Walks‘𝐺) ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))))))

Distinct variable groups: 𝑘,𝐹 𝑘,𝐺 𝑃,𝑘 Allowed substitution hints: 𝑆(𝑘) 𝑇(𝑘) 𝑈(𝑘) 𝐼(𝑘) 𝑉(𝑘) 𝑊(𝑘)

**Proof of Theorem wlkcomp**
Step	Hyp	Ref	Expression
1		wlkcomp.1	. . . . . . 7 ⊢ 𝐹 = (1^st ‘𝑊)
2	1	eqcomi 2740	. . . . . 6 ⊢ (1^st ‘𝑊) = 𝐹
3		wlkcomp.2	. . . . . . 7 ⊢ 𝑃 = (2^nd ‘𝑊)
4	3	eqcomi 2740	. . . . . 6 ⊢ (2^nd ‘𝑊) = 𝑃
5	2, 4	pm3.2i 471	. . . . 5 ⊢ ((1^st ‘𝑊) = 𝐹 ∧ (2^nd ‘𝑊) = 𝑃)
6		eqop 7999	. . . . 5 ⊢ (𝑊 ∈ (𝑆 × 𝑇) → (𝑊 = ⟨𝐹, 𝑃⟩ ↔ ((1^st ‘𝑊) = 𝐹 ∧ (2^nd ‘𝑊) = 𝑃)))
7	5, 6	mpbiri 257	. . . 4 ⊢ (𝑊 ∈ (𝑆 × 𝑇) → 𝑊 = ⟨𝐹, 𝑃⟩)
8	7	eleq1d 2817	. . 3 ⊢ (𝑊 ∈ (𝑆 × 𝑇) → (𝑊 ∈ (Walks‘𝐺) ↔ ⟨𝐹, 𝑃⟩ ∈ (Walks‘𝐺)))
9		df-br 5142	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 ↔ ⟨𝐹, 𝑃⟩ ∈ (Walks‘𝐺))
10	8, 9	bitr4di 288	. 2 ⊢ (𝑊 ∈ (𝑆 × 𝑇) → (𝑊 ∈ (Walks‘𝐺) ↔ 𝐹(Walks‘𝐺)𝑃))
11		wlkcomp.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
12		wlkcomp.i	. . 3 ⊢ 𝐼 = (iEdg‘𝐺)
13	11, 12	iswlkg 28735	. 2 ⊢ (𝐺 ∈ 𝑈 → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))))))
14	10, 13	sylan9bbr 511	1 ⊢ ((𝐺 ∈ 𝑈 ∧ 𝑊 ∈ (𝑆 × 𝑇)) → (𝑊 ∈ (Walks‘𝐺) ↔ (𝐹 ∈ Word dom 𝐼 ∧ 𝑃:(0...(♯‘𝐹))⟶𝑉 ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), (𝐼‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ (𝐼‘(𝐹‘𝑘))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 if-wif 1061 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3060 ⊆ wss 3944 {csn 4622 {cpr 4624 ⟨cop 4628 class class class wbr 5141 × cxp 5667 dom cdm 5669 ⟶wf 6528 ‘cfv 6532 (class class class)co 7393 1^st c1st 7955 2^nd c2nd 7956 0cc0 11092 1c1 11093 + caddc 11095 ...cfz 13466 ..^cfzo 13609 ♯chash 14272 Word cword 14446 Vtxcvtx 28121 iEdgciedg 28122 Walkscwlks 28718

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 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169

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 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-er 8686 df-map 8805 df-pm 8806 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-card 9916 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-n0 12455 df-z 12541 df-uz 12805 df-fz 13467 df-fzo 13610 df-hash 14273 df-word 14447 df-wlks 28721

This theorem is referenced by: wlkcompim 28754

W3C validator