Theorem wlkp1 29773

Description: Append one path segment (edge) 𝐸 from vertex (𝑃‘𝑁) to a vertex 𝐶 to a walk ⟨𝐹, 𝑃⟩ to become a walk ⟨𝐻, 𝑄⟩ of the supergraph 𝑆 obtained by adding the new edge to the graph 𝐺. Formerly proven directly for Eulerian paths (for pseudographs), see eupthp1 30311. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 6-Mar-2021.) (Proof shortened by AV, 18-Apr-2021.) (Revised by AV, 8-Apr-2024.)

Hypotheses

Ref	Expression
wlkp1.v	⊢ 𝑉 = (Vtx‘𝐺)
wlkp1.i	⊢ 𝐼 = (iEdg‘𝐺)
wlkp1.f	⊢ (𝜑 → Fun 𝐼)
wlkp1.a	⊢ (𝜑 → 𝐼 ∈ Fin)
wlkp1.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
wlkp1.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
wlkp1.d	⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼)
wlkp1.w	⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
wlkp1.n	⊢ 𝑁 = (♯‘𝐹)
wlkp1.e	⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺))
wlkp1.x	⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸)
wlkp1.u	⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {⟨𝐵, 𝐸⟩}))
wlkp1.h	⊢ 𝐻 = (𝐹 ∪ {⟨𝑁, 𝐵⟩})
wlkp1.q	⊢ 𝑄 = (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩})
wlkp1.s	⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
wlkp1.l	⊢ ((𝜑 ∧ 𝐶 = (𝑃‘𝑁)) → 𝐸 = {𝐶})

Assertion

Ref	Expression
wlkp1	⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄)

Proof of Theorem wlkp1

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wlkp1.w	. . . . . 6 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
2		wlkp1.i	. . . . . . 7 ⊢ 𝐼 = (iEdg‘𝐺)
3	2	wlkf 29708	. . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
4		wrdf 14478	. . . . . . 7 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼)
5		wlkp1.n	. . . . . . . . . 10 ⊢ 𝑁 = (♯‘𝐹)
6	5	eqcomi 2749	. . . . . . . . 9 ⊢ (♯‘𝐹) = 𝑁
7	6	oveq2i 7374	. . . . . . . 8 ⊢ (0..^(♯‘𝐹)) = (0..^𝑁)
8	7	feq2i 6654	. . . . . . 7 ⊢ (𝐹:(0..^(♯‘𝐹))⟶dom 𝐼 ↔ 𝐹:(0..^𝑁)⟶dom 𝐼)
9	4, 8	sylib 219	. . . . . 6 ⊢ (𝐹 ∈ Word dom 𝐼 → 𝐹:(0..^𝑁)⟶dom 𝐼)
10	1, 3, 9	3syl 18	. . . . 5 ⊢ (𝜑 → 𝐹:(0..^𝑁)⟶dom 𝐼)
11	5	fvexi 6848	. . . . . . 7 ⊢ 𝑁 ∈ V
12	11	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ V)
13		wlkp1.b	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
14		snidg 4599	. . . . . . . 8 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ {𝐵})
15	13, 14	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ {𝐵})
16		wlkp1.e	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺))
17		dmsnopg 6171	. . . . . . . 8 ⊢ (𝐸 ∈ (Edg‘𝐺) → dom {⟨𝐵, 𝐸⟩} = {𝐵})
18	16, 17	syl 17	. . . . . . 7 ⊢ (𝜑 → dom {⟨𝐵, 𝐸⟩} = {𝐵})
19	15, 18	eleqtrrd 2843	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ dom {⟨𝐵, 𝐸⟩})
20	12, 19	fsnd 6818	. . . . 5 ⊢ (𝜑 → {⟨𝑁, 𝐵⟩}:{𝑁}⟶dom {⟨𝐵, 𝐸⟩})
21		fzodisjsn 13650	. . . . . 6 ⊢ ((0..^𝑁) ∩ {𝑁}) = ∅
22	21	a1i 11	. . . . 5 ⊢ (𝜑 → ((0..^𝑁) ∩ {𝑁}) = ∅)
23		fun 6696	. . . . 5 ⊢ (((𝐹:(0..^𝑁)⟶dom 𝐼 ∧ {⟨𝑁, 𝐵⟩}:{𝑁}⟶dom {⟨𝐵, 𝐸⟩}) ∧ ((0..^𝑁) ∩ {𝑁}) = ∅) → (𝐹 ∪ {⟨𝑁, 𝐵⟩}):((0..^𝑁) ∪ {𝑁})⟶(dom 𝐼 ∪ dom {⟨𝐵, 𝐸⟩}))
24	10, 20, 22, 23	syl21anc 843	. . . 4 ⊢ (𝜑 → (𝐹 ∪ {⟨𝑁, 𝐵⟩}):((0..^𝑁) ∪ {𝑁})⟶(dom 𝐼 ∪ dom {⟨𝐵, 𝐸⟩}))
25		wlkp1.h	. . . . . 6 ⊢ 𝐻 = (𝐹 ∪ {⟨𝑁, 𝐵⟩})
26	25	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐻 = (𝐹 ∪ {⟨𝑁, 𝐵⟩}))
27		wlkp1.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
28		wlkp1.f	. . . . . . . 8 ⊢ (𝜑 → Fun 𝐼)
29		wlkp1.a	. . . . . . . 8 ⊢ (𝜑 → 𝐼 ∈ Fin)
30		wlkp1.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
31		wlkp1.d	. . . . . . . 8 ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼)
32		wlkp1.x	. . . . . . . 8 ⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸)
33		wlkp1.u	. . . . . . . 8 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {⟨𝐵, 𝐸⟩}))
34	27, 2, 28, 29, 13, 30, 31, 1, 5, 16, 32, 33, 25	wlkp1lem2 29766	. . . . . . 7 ⊢ (𝜑 → (♯‘𝐻) = (𝑁 + 1))
35	34	oveq2d 7379	. . . . . 6 ⊢ (𝜑 → (0..^(♯‘𝐻)) = (0..^(𝑁 + 1)))
36		wlkcl 29709	. . . . . . . 8 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0)
37		eleq1 2828	. . . . . . . . . . 11 ⊢ ((♯‘𝐹) = 𝑁 → ((♯‘𝐹) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0))
38	37	eqcoms 2748	. . . . . . . . . 10 ⊢ (𝑁 = (♯‘𝐹) → ((♯‘𝐹) ∈ ℕ0 ↔ 𝑁 ∈ ℕ0))
39		elnn0uz 12827	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (ℤ≥‘0))
40	39	biimpi 217	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘0))
41	38, 40	biimtrdi 254	. . . . . . . . 9 ⊢ (𝑁 = (♯‘𝐹) → ((♯‘𝐹) ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘0)))
42	5, 41	ax-mp 5	. . . . . . . 8 ⊢ ((♯‘𝐹) ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘0))
43	1, 36, 42	3syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0))
44		fzosplitsn 13729	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘0) → (0..^(𝑁 + 1)) = ((0..^𝑁) ∪ {𝑁}))
45	43, 44	syl 17	. . . . . 6 ⊢ (𝜑 → (0..^(𝑁 + 1)) = ((0..^𝑁) ∪ {𝑁}))
46	35, 45	eqtrd 2775	. . . . 5 ⊢ (𝜑 → (0..^(♯‘𝐻)) = ((0..^𝑁) ∪ {𝑁}))
47	33	dmeqd 5854	. . . . . 6 ⊢ (𝜑 → dom (iEdg‘𝑆) = dom (𝐼 ∪ {⟨𝐵, 𝐸⟩}))
48		dmun 5859	. . . . . 6 ⊢ dom (𝐼 ∪ {⟨𝐵, 𝐸⟩}) = (dom 𝐼 ∪ dom {⟨𝐵, 𝐸⟩})
49	47, 48	eqtrdi 2791	. . . . 5 ⊢ (𝜑 → dom (iEdg‘𝑆) = (dom 𝐼 ∪ dom {⟨𝐵, 𝐸⟩}))
50	26, 46, 49	feq123d 6651	. . . 4 ⊢ (𝜑 → (𝐻:(0..^(♯‘𝐻))⟶dom (iEdg‘𝑆) ↔ (𝐹 ∪ {⟨𝑁, 𝐵⟩}):((0..^𝑁) ∪ {𝑁})⟶(dom 𝐼 ∪ dom {⟨𝐵, 𝐸⟩})))
51	24, 50	mpbird 258	. . 3 ⊢ (𝜑 → 𝐻:(0..^(♯‘𝐻))⟶dom (iEdg‘𝑆))
52		iswrdb 14480	. . 3 ⊢ (𝐻 ∈ Word dom (iEdg‘𝑆) ↔ 𝐻:(0..^(♯‘𝐻))⟶dom (iEdg‘𝑆))
53	51, 52	sylibr 235	. 2 ⊢ (𝜑 → 𝐻 ∈ Word dom (iEdg‘𝑆))
54	27	wlkp 29710	. . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
55	1, 54	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶𝑉)
56	5	oveq2i 7374	. . . . . . 7 ⊢ (0...𝑁) = (0...(♯‘𝐹))
57	56	feq2i 6654	. . . . . 6 ⊢ (𝑃:(0...𝑁)⟶𝑉 ↔ 𝑃:(0...(♯‘𝐹))⟶𝑉)
58	55, 57	sylibr 235	. . . . 5 ⊢ (𝜑 → 𝑃:(0...𝑁)⟶𝑉)
59		ovexd 7398	. . . . . 6 ⊢ (𝜑 → (𝑁 + 1) ∈ V)
60	59, 30	fsnd 6818	. . . . 5 ⊢ (𝜑 → {⟨(𝑁 + 1), 𝐶⟩}:{(𝑁 + 1)}⟶𝑉)
61		fzp1disj 13535	. . . . . 6 ⊢ ((0...𝑁) ∩ {(𝑁 + 1)}) = ∅
62	61	a1i 11	. . . . 5 ⊢ (𝜑 → ((0...𝑁) ∩ {(𝑁 + 1)}) = ∅)
63		fun 6696	. . . . 5 ⊢ (((𝑃:(0...𝑁)⟶𝑉 ∧ {⟨(𝑁 + 1), 𝐶⟩}:{(𝑁 + 1)}⟶𝑉) ∧ ((0...𝑁) ∩ {(𝑁 + 1)}) = ∅) → (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):((0...𝑁) ∪ {(𝑁 + 1)})⟶(𝑉 ∪ 𝑉))
64	58, 60, 62, 63	syl21anc 843	. . . 4 ⊢ (𝜑 → (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):((0...𝑁) ∪ {(𝑁 + 1)})⟶(𝑉 ∪ 𝑉))
65		fzsuc 13523	. . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘0) → (0...(𝑁 + 1)) = ((0...𝑁) ∪ {(𝑁 + 1)}))
66	43, 65	syl 17	. . . . 5 ⊢ (𝜑 → (0...(𝑁 + 1)) = ((0...𝑁) ∪ {(𝑁 + 1)}))
67		unidm 4094	. . . . . . 7 ⊢ (𝑉 ∪ 𝑉) = 𝑉
68	67	eqcomi 2749	. . . . . 6 ⊢ 𝑉 = (𝑉 ∪ 𝑉)
69	68	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑉 = (𝑉 ∪ 𝑉))
70	66, 69	feq23d 6657	. . . 4 ⊢ (𝜑 → ((𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):(0...(𝑁 + 1))⟶𝑉 ↔ (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):((0...𝑁) ∪ {(𝑁 + 1)})⟶(𝑉 ∪ 𝑉)))
71	64, 70	mpbird 258	. . 3 ⊢ (𝜑 → (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):(0...(𝑁 + 1))⟶𝑉)
72		wlkp1.q	. . . . 5 ⊢ 𝑄 = (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩})
73	72	a1i 11	. . . 4 ⊢ (𝜑 → 𝑄 = (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}))
74	34	oveq2d 7379	. . . 4 ⊢ (𝜑 → (0...(♯‘𝐻)) = (0...(𝑁 + 1)))
75		wlkp1.s	. . . 4 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
76	73, 74, 75	feq123d 6651	. . 3 ⊢ (𝜑 → (𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ↔ (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩}):(0...(𝑁 + 1))⟶𝑉))
77	71, 76	mpbird 258	. 2 ⊢ (𝜑 → 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆))
78		wlkp1.l	. . 3 ⊢ ((𝜑 ∧ 𝐶 = (𝑃‘𝑁)) → 𝐸 = {𝐶})
79	27, 2, 28, 29, 13, 30, 31, 1, 5, 16, 32, 33, 25, 72, 75, 78	wlkp1lem8 29772	. 2 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑘) = (𝑄‘(𝑘 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑘)) = {(𝑄‘𝑘)}, {(𝑄‘𝑘), (𝑄‘(𝑘 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑘))))
80	27, 2, 28, 29, 13, 30, 31, 1, 5, 16, 32, 33, 25, 72, 75	wlkp1lem4 29768	. . 3 ⊢ (𝜑 → (𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V))
81		eqid 2740	. . . 4 ⊢ (Vtx‘𝑆) = (Vtx‘𝑆)
82		eqid 2740	. . . 4 ⊢ (iEdg‘𝑆) = (iEdg‘𝑆)
83	81, 82	iswlk 29704	. . 3 ⊢ ((𝑆 ∈ V ∧ 𝐻 ∈ V ∧ 𝑄 ∈ V) → (𝐻(Walks‘𝑆)𝑄 ↔ (𝐻 ∈ Word dom (iEdg‘𝑆) ∧ 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ∧ ∀𝑘 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑘) = (𝑄‘(𝑘 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑘)) = {(𝑄‘𝑘)}, {(𝑄‘𝑘), (𝑄‘(𝑘 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑘))))))
84	80, 83	syl 17	. 2 ⊢ (𝜑 → (𝐻(Walks‘𝑆)𝑄 ↔ (𝐻 ∈ Word dom (iEdg‘𝑆) ∧ 𝑄:(0...(♯‘𝐻))⟶(Vtx‘𝑆) ∧ ∀𝑘 ∈ (0..^(♯‘𝐻))if-((𝑄‘𝑘) = (𝑄‘(𝑘 + 1)), ((iEdg‘𝑆)‘(𝐻‘𝑘)) = {(𝑄‘𝑘)}, {(𝑄‘𝑘), (𝑄‘(𝑘 + 1))} ⊆ ((iEdg‘𝑆)‘(𝐻‘𝑘))))))
85	53, 77, 79, 84	mpbir3and 1349	1 ⊢ (𝜑 → 𝐻(Walks‘𝑆)𝑄)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396  if-wif 1068   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119  ∀wral 3054  Vcvv 3432   ∪ cun 3888   ∩ cin 3889   ⊆ wss 3890  ∅c0 4268  {csn 4562  {cpr 4564  ⟨cop 4568   class class class wbr 5079  dom cdm 5625  Fun wfun 6486  ⟶wf 6488  ‘cfv 6492  (class class class)co 7363  Fincfn 8890  0cc0 11036  1c1 11037   + caddc 11039  ℕ₀cn0 12435  ℤ_≥cuz 12786  ...cfz 13459  ..^cfzo 13606  ♯chash 14290  Word cword 14473  Vtxcvtx 29090  iEdgciedg 29091  Edgcedg 29141  Walkscwlks 29690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-resscn 11093  ax-1cn 11094  ax-icn 11095  ax-addcl 11096  ax-addrcl 11097  ax-mulcl 11098  ax-mulrcl 11099  ax-mulcom 11100  ax-addass 11101  ax-mulass 11102  ax-distr 11103  ax-i2m1 11104  ax-1ne0 11105  ax-1rid 11106  ax-rnegex 11107  ax-rrecex 11108  ax-cnre 11109  ax-pre-lttri 11110  ax-pre-lttrn 11111  ax-pre-ltadd 11112  ax-pre-mulgt0 11113

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-ifp 1069  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-nel 3040  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-om 7814  df-1st 7938  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-1o 8402  df-oadd 8406  df-er 8640  df-map 8772  df-pm 8773  df-en 8891  df-dom 8892  df-sdom 8893  df-fin 8894  df-dju 9823  df-card 9861  df-pnf 11179  df-mnf 11180  df-xr 11181  df-ltxr 11182  df-le 11183  df-sub 11377  df-neg 11378  df-nn 12173  df-n0 12436  df-z 12523  df-uz 12787  df-fz 13460  df-fzo 13607  df-hash 14291  df-word 14474  df-wlks 29693

This theorem is referenced by:  eupthp1  30311