Theorem isclwlk 30137

Description: A pair of functions represents a closed walk iff it represents a walk in which the first vertex is equal to the last vertex. (Contributed by Alexander van der Vekens, 24-Jun-2018.) (Revised by AV, 16-Feb-2021.) (Proof shortened by AV, 30-Oct-2021.)

Assertion

Ref	Expression
isclwlk	⊢ (𝐹(ClWalks‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))

Proof of Theorem isclwlk

Dummy variables 𝑓 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		clwlks 30136	. 2 ⊢ (ClWalks‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Walks‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}
2		fveq1 6884	. . . 4 ⊢ (𝑝 = 𝑃 → (𝑝‘0) = (𝑃‘0))
3	2	adantl 487	. . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝑝‘0) = (𝑃‘0))
4		simpr 490	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → 𝑝 = 𝑃)
5		fveq2 6885	. . . . 5 ⊢ (𝑓 = 𝐹 → (♯‘𝑓) = (♯‘𝐹))
6	5	adantr 486	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (♯‘𝑓) = (♯‘𝐹))
7	4, 6	fveq12d 6892	. . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝑝‘(♯‘𝑓)) = (𝑃‘(♯‘𝐹)))
8	3, 7	eqeq12d 2782	. 2 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → ((𝑝‘0) = (𝑝‘(♯‘𝑓)) ↔ (𝑃‘0) = (𝑃‘(♯‘𝐹))))
9		relwlk 29990	. 2 ⊢ Rel (Walks‘𝐺)
10	1, 8, 9	brfvopabrbr 6990	1 ⊢ (𝐹(ClWalks‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹))))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   class class class wbr 5112  ‘cfv 6540  0cc0 11110  ♯chash 14377  Walkscwlks 29961  ClWalkscclwlks 30134

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5260  ax-nul 5272  ax-pr 5407

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4491  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-br 5113  df-opab 5177  df-mpt 5196  df-id 5559  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-iota 6496  df-fun 6542  df-fv 6548  df-wlks 29964  df-clwlks 30135

This theorem is used by:  clwlkiswlk  30138  isclwlke  30141  isclwlkupgr  30142  clwlkcompbp  30146  clwlkl1loop  30147  crctisclwlk  30158  clwlkclwwlkflem  30370  clwlkclwwlkf  30374  0clwlk  30496