Theorem wlkl1loop 28690

Description: A walk of length 1 from a vertex to itself is a loop. (Contributed by AV, 23-Apr-2021.)

Assertion

Ref	Expression
wlkl1loop	⊢ (((Fun (iEdg‘𝐺) ∧ 𝐹(Walks‘𝐺)𝑃) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} ∈ (Edg‘𝐺))

Proof of Theorem wlkl1loop

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wlkv 28664	. . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → (𝐺 ∈ V ∧ 𝐹 ∈ V ∧ 𝑃 ∈ V))
2		simp3l 1201	. . . . . . . . 9 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → Fun (iEdg‘𝐺))
3		simp2 1137	. . . . . . . . 9 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → 𝐹(Walks‘𝐺)𝑃)
4		c0ex 11180	. . . . . . . . . . . . 13 ⊢ 0 ∈ V
5	4	snid 4649	. . . . . . . . . . . 12 ⊢ 0 ∈ {0}
6		oveq2 7392	. . . . . . . . . . . . 13 ⊢ ((♯‘𝐹) = 1 → (0..^(♯‘𝐹)) = (0..^1))
7		fzo01 13686	. . . . . . . . . . . . 13 ⊢ (0..^1) = {0}
8	6, 7	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((♯‘𝐹) = 1 → (0..^(♯‘𝐹)) = {0})
9	5, 8	eleqtrrid 2839	. . . . . . . . . . 11 ⊢ ((♯‘𝐹) = 1 → 0 ∈ (0..^(♯‘𝐹)))
10	9	ad2antrl 726	. . . . . . . . . 10 ⊢ ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → 0 ∈ (0..^(♯‘𝐹)))
11	10	3ad2ant3 1135	. . . . . . . . 9 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → 0 ∈ (0..^(♯‘𝐹)))
12		eqid 2731	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
13	12	iedginwlk 28689	. . . . . . . . 9 ⊢ ((Fun (iEdg‘𝐺) ∧ 𝐹(Walks‘𝐺)𝑃 ∧ 0 ∈ (0..^(♯‘𝐹))) → ((iEdg‘𝐺)‘(𝐹‘0)) ∈ ran (iEdg‘𝐺))
14	2, 3, 11, 13	syl3anc 1371	. . . . . . . 8 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → ((iEdg‘𝐺)‘(𝐹‘0)) ∈ ran (iEdg‘𝐺))
15		eqid 2731	. . . . . . . . . . 11 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
16	15, 12	iswlkg 28665	. . . . . . . . . 10 ⊢ (𝐺 ∈ V → (𝐹(Walks‘𝐺)𝑃 ↔ (𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))))))
17	8	raleqdv 3322	. . . . . . . . . . . . . . 15 ⊢ ((♯‘𝐹) = 1 → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ ∀𝑘 ∈ {0}if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘)))))
18		oveq1 7391	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 0 → (𝑘 + 1) = (0 + 1))
19		0p1e1 12306	. . . . . . . . . . . . . . . . . 18 ⊢ (0 + 1) = 1
20	18, 19	eqtrdi 2787	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 0 → (𝑘 + 1) = 1)
21		wkslem2 28660	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 = 0 ∧ (𝑘 + 1) = 1) → (if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))))
22	20, 21	mpdan 685	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 0 → (if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))))
23	4, 22	ralsn 4669	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ {0}if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0))))
24	17, 23	bitrdi 286	. . . . . . . . . . . . . 14 ⊢ ((♯‘𝐹) = 1 → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))))
25	24	ad2antrl 726	. . . . . . . . . . . . 13 ⊢ ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) ↔ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))))
26		ifptru 1074	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃‘0) = (𝑃‘1) → (if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0))) ↔ ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}))
27	26	biimpa 477	. . . . . . . . . . . . . . . 16 ⊢ (((𝑃‘0) = (𝑃‘1) ∧ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))) → ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)})
28	27	eqcomd 2737	. . . . . . . . . . . . . . 15 ⊢ (((𝑃‘0) = (𝑃‘1) ∧ if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0)))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0)))
29	28	ex 413	. . . . . . . . . . . . . 14 ⊢ ((𝑃‘0) = (𝑃‘1) → (if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0))))
30	29	ad2antll 727	. . . . . . . . . . . . 13 ⊢ ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → (if-((𝑃‘0) = (𝑃‘1), ((iEdg‘𝐺)‘(𝐹‘0)) = {(𝑃‘0)}, {(𝑃‘0), (𝑃‘1)} ⊆ ((iEdg‘𝐺)‘(𝐹‘0))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0))))
31	25, 30	sylbid 239	. . . . . . . . . . . 12 ⊢ ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0))))
32	31	com12 32	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘))) → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0))))
33	32	3ad2ant3 1135	. . . . . . . . . 10 ⊢ ((𝐹 ∈ Word dom (iEdg‘𝐺) ∧ 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺) ∧ ∀𝑘 ∈ (0..^(♯‘𝐹))if-((𝑃‘𝑘) = (𝑃‘(𝑘 + 1)), ((iEdg‘𝐺)‘(𝐹‘𝑘)) = {(𝑃‘𝑘)}, {(𝑃‘𝑘), (𝑃‘(𝑘 + 1))} ⊆ ((iEdg‘𝐺)‘(𝐹‘𝑘)))) → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0))))
34	16, 33	syl6bi 252	. . . . . . . . 9 ⊢ (𝐺 ∈ V → (𝐹(Walks‘𝐺)𝑃 → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0)))))
35	34	3imp 1111	. . . . . . . 8 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → {(𝑃‘0)} = ((iEdg‘𝐺)‘(𝐹‘0)))
36		edgval 28104	. . . . . . . . 9 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
37	36	a1i 11	. . . . . . . 8 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → (Edg‘𝐺) = ran (iEdg‘𝐺))
38	14, 35, 37	3eltr4d 2847	. . . . . . 7 ⊢ ((𝐺 ∈ V ∧ 𝐹(Walks‘𝐺)𝑃 ∧ (Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)))) → {(𝑃‘0)} ∈ (Edg‘𝐺))
39	38	3exp 1119	. . . . . 6 ⊢ (𝐺 ∈ V → (𝐹(Walks‘𝐺)𝑃 → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} ∈ (Edg‘𝐺))))
40	39	3ad2ant1 1133	. . . . 5 ⊢ ((𝐺 ∈ V ∧ 𝐹 ∈ V ∧ 𝑃 ∈ V) → (𝐹(Walks‘𝐺)𝑃 → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} ∈ (Edg‘𝐺))))
41	1, 40	mpcom 38	. . . 4 ⊢ (𝐹(Walks‘𝐺)𝑃 → ((Fun (iEdg‘𝐺) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} ∈ (Edg‘𝐺)))
42	41	expd 416	. . 3 ⊢ (𝐹(Walks‘𝐺)𝑃 → (Fun (iEdg‘𝐺) → (((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)) → {(𝑃‘0)} ∈ (Edg‘𝐺))))
43	42	impcom 408	. 2 ⊢ ((Fun (iEdg‘𝐺) ∧ 𝐹(Walks‘𝐺)𝑃) → (((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1)) → {(𝑃‘0)} ∈ (Edg‘𝐺)))
44	43	imp 407	1 ⊢ (((Fun (iEdg‘𝐺) ∧ 𝐹(Walks‘𝐺)𝑃) ∧ ((♯‘𝐹) = 1 ∧ (𝑃‘0) = (𝑃‘1))) → {(𝑃‘0)} ∈ (Edg‘𝐺))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  if-wif 1061   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3060  Vcvv 3466   ⊆ wss 3935  {csn 4613  {cpr 4615   class class class wbr 5132  dom cdm 5660  ran crn 5661  Fun wfun 6517  ⟶wf 6519  ‘cfv 6523  (class class class)co 7384  0cc0 11082  1c1 11083   + caddc 11085  ...cfz 13456  ..^cfzo 13599  ♯chash 14262  Word cword 14436  Vtxcvtx 28051  iEdgciedg 28052  Edgcedg 28102  Walkscwlks 28648

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 5269  ax-sep 5283  ax-nul 5290  ax-pow 5347  ax-pr 5411  ax-un 7699  ax-cnex 11138  ax-resscn 11139  ax-1cn 11140  ax-icn 11141  ax-addcl 11142  ax-addrcl 11143  ax-mulcl 11144  ax-mulrcl 11145  ax-mulcom 11146  ax-addass 11147  ax-mulass 11148  ax-distr 11149  ax-i2m1 11150  ax-1ne0 11151  ax-1rid 11152  ax-rnegex 11153  ax-rrecex 11154  ax-cnre 11155  ax-pre-lttri 11156  ax-pre-lttrn 11157  ax-pre-ltadd 11158  ax-pre-mulgt0 11159

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 3372  df-rab 3426  df-v 3468  df-sbc 3765  df-csb 3881  df-dif 3938  df-un 3940  df-in 3942  df-ss 3952  df-pss 3954  df-nul 4310  df-if 4514  df-pw 4589  df-sn 4614  df-pr 4616  df-op 4620  df-uni 4893  df-int 4935  df-iun 4983  df-br 5133  df-opab 5195  df-mpt 5216  df-tr 5250  df-id 5558  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5615  df-we 5617  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6280  df-ord 6347  df-on 6348  df-lim 6349  df-suc 6350  df-iota 6475  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7340  df-ov 7387  df-oprab 7388  df-mpo 7389  df-om 7830  df-1st 7948  df-2nd 7949  df-frecs 8239  df-wrecs 8270  df-recs 8344  df-rdg 8383  df-1o 8439  df-er 8677  df-map 8796  df-pm 8797  df-en 8913  df-dom 8914  df-sdom 8915  df-fin 8916  df-card 9906  df-pnf 11222  df-mnf 11223  df-xr 11224  df-ltxr 11225  df-le 11226  df-sub 11418  df-neg 11419  df-nn 12185  df-n0 12445  df-z 12531  df-uz 12795  df-fz 13457  df-fzo 13600  df-hash 14263  df-word 14437  df-edg 28103  df-wlks 28651

This theorem is referenced by:  clwlkl1loop  28835  loop1cycl  33859