wlkcpr - Metamath Proof Explorer

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

Theorem wlkcpr 29683

Description: A walk as class with two components. (Contributed by Alexander van der Vekens, 22-Jul-2018.) (Revised by AV, 2-Jan-2021.)

**Assertion**
Ref	Expression
wlkcpr	⊢ (𝑊 ∈ (Walks‘𝐺) ↔ (1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊))

**Proof of Theorem wlkcpr**
Step	Hyp	Ref	Expression
1		wlkop 29682	. 2 ⊢ (𝑊 ∈ (Walks‘𝐺) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
2		wlkvv 29681	. . 3 ⊢ ((1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊) → 𝑊 ∈ (V × V))
3		1st2ndb 7973	. . 3 ⊢ (𝑊 ∈ (V × V) ↔ 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
4	2, 3	sylib 218	. 2 ⊢ ((1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
5		eleq1 2823	. . 3 ⊢ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ → (𝑊 ∈ (Walks‘𝐺) ↔ ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ ∈ (Walks‘𝐺)))
6		df-br 5098	. . 3 ⊢ ((1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊) ↔ ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ ∈ (Walks‘𝐺))
7	5, 6	bitr4di 289	. 2 ⊢ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ → (𝑊 ∈ (Walks‘𝐺) ↔ (1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊)))
8	1, 4, 7	pm5.21nii 378	1 ⊢ (𝑊 ∈ (Walks‘𝐺) ↔ (1^st ‘𝑊)(Walks‘𝐺)(2^nd ‘𝑊))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 206 = wceq 1542 ∈ wcel 2114 Vcvv 3439 ⟨cop 4585 class class class wbr 5097 × cxp 5621 ‘cfv 6491 1^st c1st 7931 2^nd c2nd 7932 Walkscwlks 29651

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12148 df-n0 12404 df-z 12491 df-uz 12754 df-fz 13426 df-fzo 13573 df-hash 14256 df-word 14439 df-wlks 29654

This theorem is referenced by: wlk2f 29684 wlkcompim 29686 upgrwlkcompim 29697 uspgr2wlkeqi 29702 wlkv0 29704 g0wlk0 29705 wlkswwlksf1o 29933 wlknewwlksn 29941 wlknwwlksnbij 29942 clwlkclwwlkf1 30066 clwlknf1oclwwlknlem1 30137 clwlknf1oclwwlkn 30140 clwwlknonclwlknonf1o 30418 dlwwlknondlwlknonf1olem1 30420

W3C validator