clwlkcompbp - Metamath Proof Explorer

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

Theorem clwlkcompbp 30256

Description: Basic properties of the components of a closed walk. (Contributed by AV, 23-May-2022.)

**Hypotheses**
Ref	Expression
clwlkcompbp.1	⊢ 𝐹 = (1^st ‘𝑊)
clwlkcompbp.2	⊢ 𝑃 = (2^nd ‘𝑊)

**Assertion**
Ref	Expression
clwlkcompbp	⊢ (𝑊 ∈ (ClWalks‘𝐺) → (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))

**Proof of Theorem clwlkcompbp**
Step	Hyp	Ref	Expression
1		clwlkwlk 30249	. . 3 ⊢ (𝑊 ∈ (ClWalks‘𝐺) → 𝑊 ∈ (Walks‘𝐺))
2		wlkop 30095	. . 3 ⊢ (𝑊 ∈ (Walks‘𝐺) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
3	1, 2	syl 18	. 2 ⊢ (𝑊 ∈ (ClWalks‘𝐺) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
4		eleq1 2850	. . . 4 ⊢ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ → (𝑊 ∈ (ClWalks‘𝐺) ↔ ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ ∈ (ClWalks‘𝐺)))
5		df-br 5108	. . . 4 ⊢ ((1^st ‘𝑊)(ClWalks‘𝐺)(2^nd ‘𝑊) ↔ ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ ∈ (ClWalks‘𝐺))
6	4, 5	bitr4di 292	. . 3 ⊢ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ → (𝑊 ∈ (ClWalks‘𝐺) ↔ (1^st ‘𝑊)(ClWalks‘𝐺)(2^nd ‘𝑊)))
7		isclwlk 30247	. . . 4 ⊢ ((1^st ‘𝑊)(ClWalks‘𝐺)(2^nd ‘𝑊) ↔ ((1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊) ∧ ((2^nd ‘𝑊)‘0) = ((2^nd ‘𝑊)‘(♯‘(1^st ‘𝑊)))))
8		clwlkcompbp.1	. . . . . 6 ⊢ 𝐹 = (1^st ‘𝑊)
9		clwlkcompbp.2	. . . . . 6 ⊢ 𝑃 = (2^nd ‘𝑊)
10	8, 9	breq12i 5116	. . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 ↔ (1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊))
11	9	fveq1i 6883	. . . . . 6 ⊢ (𝑃‘0) = ((2^nd ‘𝑊)‘0)
12	8	fveq2i 6885	. . . . . . 7 ⊢ (♯‘𝐹) = (♯‘(1^st ‘𝑊))
13	9, 12	fveq12i 6888	. . . . . 6 ⊢ (𝑃‘(♯‘𝐹)) = ((2^nd ‘𝑊)‘(♯‘(1^st ‘𝑊)))
14	11, 13	eqeq12i 2780	. . . . 5 ⊢ ((𝑃‘0) = (𝑃‘(♯‘𝐹)) ↔ ((2^nd ‘𝑊)‘0) = ((2^nd ‘𝑊)‘(♯‘(1^st ‘𝑊))))
15	10, 14	anbi12i 640	. . . 4 ⊢ ((𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))) ↔ ((1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊) ∧ ((2^nd ‘𝑊)‘0) = ((2^nd ‘𝑊)‘(♯‘(1^st ‘𝑊)))))
16	7, 15	sylbb2 241	. . 3 ⊢ ((1^st ‘𝑊)(ClWalks‘𝐺)(2^nd ‘𝑊) → (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))
17	6, 16	biimtrdi 256	. 2 ⊢ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ → (𝑊 ∈ (ClWalks‘𝐺) → (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹)))))
18	3, 17	mpcom 39	1 ⊢ (𝑊 ∈ (ClWalks‘𝐺) → (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⟨cop 4593 class class class wbr 5107 ‘cfv 6537 1^st c1st 7988 2^nd c2nd 7989 0cc0 11128 ♯chash 14398 Walkscwlks 30064 ClWalkscclwlks 30244

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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 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-iota 6493 df-fun 6539 df-fv 6545 df-1st 7990 df-2nd 7991 df-wlks 30067 df-clwlks 30245

This theorem is used by: (None)

W3C validator