Theorem clwwlkn1loopb 16866

Description: A word represents a closed walk of length 1 iff this word is a singleton word consisting of a vertex with an attached loop. (Contributed by AV, 11-Feb-2022.)

Assertion

Ref	Expression
clwwlkn1loopb	|- ( W e. ( 1 ClWWalksN G ) <-> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) )

Distinct variable groups:   v, G   v, W

Proof of Theorem clwwlkn1loopb

Step	Hyp	Ref	Expression
1		clwwlkn1 16864	. 2 |- ( W e. ( 1 ClWWalksN G ) <-> ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) )
2		wrdl1exs1 11419	. . . . . 6 |- ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = 1 ) -> E. v e. (Vtx ` G ) W = <" v "> )
3		fveq1 5697	. . . . . . . . . . . . . . 15 |- ( W = <" v "> -> ( W ` 0 ) = ( <" v "> ` 0 ) )
4		s1fv 11416	. . . . . . . . . . . . . . 15 |- ( v e. (Vtx ` G ) -> ( <" v "> ` 0 ) = v )
5	3, 4	sylan9eq 2291	. . . . . . . . . . . . . 14 |- ( ( W = <" v "> /\ v e. (Vtx ` G ) ) -> ( W ` 0 ) = v )
6	5	sneqd 3722	. . . . . . . . . . . . 13 |- ( ( W = <" v "> /\ v e. (Vtx ` G ) ) -> { ( W ` 0 ) } = { v } )
7	6	eleq1d 2307	. . . . . . . . . . . 12 |- ( ( W = <" v "> /\ v e. (Vtx ` G ) ) -> ( { ( W ` 0 ) } e. (Edg ` G ) <-> { v } e. (Edg ` G ) ) )
8	7	biimpd 144	. . . . . . . . . . 11 |- ( ( W = <" v "> /\ v e. (Vtx ` G ) ) -> ( { ( W ` 0 ) } e. (Edg ` G ) -> { v } e. (Edg ` G ) ) )
9	8	ex 115	. . . . . . . . . 10 |- ( W = <" v "> -> ( v e. (Vtx ` G ) -> ( { ( W ` 0 ) } e. (Edg ` G ) -> { v } e. (Edg ` G ) ) ) )
10	9	com13 80	. . . . . . . . 9 |- ( { ( W ` 0 ) } e. (Edg ` G ) -> ( v e. (Vtx ` G ) -> ( W = <" v "> -> { v } e. (Edg ` G ) ) ) )
11	10	imp 124	. . . . . . . 8 |- ( ( { ( W ` 0 ) } e. (Edg ` G ) /\ v e. (Vtx ` G ) ) -> ( W = <" v "> -> { v } e. (Edg ` G ) ) )
12	11	ancld 325	. . . . . . 7 |- ( ( { ( W ` 0 ) } e. (Edg ` G ) /\ v e. (Vtx ` G ) ) -> ( W = <" v "> -> ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) )
13	12	reximdva 2652	. . . . . 6 |- ( { ( W ` 0 ) } e. (Edg ` G ) -> ( E. v e. (Vtx ` G ) W = <" v "> -> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) )
14	2, 13	syl5com 29	. . . . 5 |- ( ( W e. Word (Vtx ` G ) /\ (♯ ` W ) = 1 ) -> ( { ( W ` 0 ) } e. (Edg ` G ) -> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) )
15	14	expcom 116	. . . 4 |- ( (♯ ` W ) = 1 -> ( W e. Word (Vtx ` G ) -> ( { ( W ` 0 ) } e. (Edg ` G ) -> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) ) )
16	15	3imp 1224	. . 3 |- ( ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) -> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) )
17		s1leng 11414	. . . . . . . 8 |- ( v e. (Vtx ` G ) -> (♯ ` <" v "> ) = 1 )
18	17	adantr 276	. . . . . . 7 |- ( ( v e. (Vtx ` G ) /\ { v } e. (Edg ` G ) ) -> (♯ ` <" v "> ) = 1 )
19		s1cl 11411	. . . . . . . 8 |- ( v e. (Vtx ` G ) -> <" v "> e. Word (Vtx ` G ) )
20	19	adantr 276	. . . . . . 7 |- ( ( v e. (Vtx ` G ) /\ { v } e. (Edg ` G ) ) -> <" v "> e. Word (Vtx ` G ) )
21	4	eqcomd 2244	. . . . . . . . . . 11 |- ( v e. (Vtx ` G ) -> v = ( <" v "> ` 0 ) )
22	21	sneqd 3722	. . . . . . . . . 10 |- ( v e. (Vtx ` G ) -> { v } = { ( <" v "> ` 0 ) } )
23	22	eleq1d 2307	. . . . . . . . 9 |- ( v e. (Vtx ` G ) -> ( { v } e. (Edg ` G ) <-> { ( <" v "> ` 0 ) } e. (Edg ` G ) ) )
24	23	biimpd 144	. . . . . . . 8 |- ( v e. (Vtx ` G ) -> ( { v } e. (Edg ` G ) -> { ( <" v "> ` 0 ) } e. (Edg ` G ) ) )
25	24	imp 124	. . . . . . 7 |- ( ( v e. (Vtx ` G ) /\ { v } e. (Edg ` G ) ) -> { ( <" v "> ` 0 ) } e. (Edg ` G ) )
26	18, 20, 25	3jca 1208	. . . . . 6 |- ( ( v e. (Vtx ` G ) /\ { v } e. (Edg ` G ) ) -> ( (♯ ` <" v "> ) = 1 /\ <" v "> e. Word (Vtx ` G ) /\ { ( <" v "> ` 0 ) } e. (Edg ` G ) ) )
27	26	adantrl 482	. . . . 5 |- ( ( v e. (Vtx ` G ) /\ ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) -> ( (♯ ` <" v "> ) = 1 /\ <" v "> e. Word (Vtx ` G ) /\ { ( <" v "> ` 0 ) } e. (Edg ` G ) ) )
28		fveqeq2 5707	. . . . . . 7 |- ( W = <" v "> -> ( (♯ ` W ) = 1 <-> (♯ ` <" v "> ) = 1 ) )
29		eleq1 2301	. . . . . . 7 |- ( W = <" v "> -> ( W e. Word (Vtx ` G ) <-> <" v "> e. Word (Vtx ` G ) ) )
30	3	sneqd 3722	. . . . . . . 8 |- ( W = <" v "> -> { ( W ` 0 ) } = { ( <" v "> ` 0 ) } )
31	30	eleq1d 2307	. . . . . . 7 |- ( W = <" v "> -> ( { ( W ` 0 ) } e. (Edg ` G ) <-> { ( <" v "> ` 0 ) } e. (Edg ` G ) ) )
32	28, 29, 31	3anbi123d 1353	. . . . . 6 |- ( W = <" v "> -> ( ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) <-> ( (♯ ` <" v "> ) = 1 /\ <" v "> e. Word (Vtx ` G ) /\ { ( <" v "> ` 0 ) } e. (Edg ` G ) ) ) )
33	32	ad2antrl 494	. . . . 5 |- ( ( v e. (Vtx ` G ) /\ ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) -> ( ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) <-> ( (♯ ` <" v "> ) = 1 /\ <" v "> e. Word (Vtx ` G ) /\ { ( <" v "> ` 0 ) } e. (Edg ` G ) ) ) )
34	27, 33	mpbird 167	. . . 4 |- ( ( v e. (Vtx ` G ) /\ ( W = <" v "> /\ { v } e. (Edg ` G ) ) ) -> ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) )
35	34	rexlimiva 2663	. . 3 |- ( E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) -> ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) )
36	16, 35	impbii 126	. 2 |- ( ( (♯ ` W ) = 1 /\ W e. Word (Vtx ` G ) /\ { ( W ` 0 ) } e. (Edg ` G ) ) <-> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) )
37	1, 36	bitri 184	1 |- ( W e. ( 1 ClWWalksN G ) <-> E. v e. (Vtx ` G ) ( W = <" v "> /\ { v } e. (Edg ` G ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   E.wrex 2529   {csn 3709   ` cfv 5380  (class class class)co 6088   0cc0 8185   1c1 8186  ♯chash 11236  Word cword 11326   <"cs1 11405  Vtxcvtx 16458  Edgcedg 16503   ClWWalksN cclwwlkn 16849

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-er 6811  df-map 6928  df-en 7027  df-dom 7028  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-fzo 10567  df-ihash 11237  df-word 11327  df-lsw 11372  df-s1 11406  df-ndx 13413  df-slot 13414  df-base 13416  df-vtx 16460  df-clwwlk 16838  df-clwwlkn 16850

This theorem is used by: (None)