Theorem wlkp1lem6 29696

Description: Lemma for wlkp1 29699. (Contributed by AV, 6-Mar-2021.)

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‘𝑆) = 𝑉)

Assertion

Ref	Expression
wlkp1lem6	⊢ (𝜑 → ∀𝑘 ∈ (0..^𝑁)((𝑄‘𝑘) = (𝑃‘𝑘) ∧ (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)) ∧ ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘))))

Distinct variable group:   𝜑,𝑘

Allowed substitution hints:   𝐵(𝑘)   𝐶(𝑘)   𝑃(𝑘)   𝑄(𝑘)   𝑆(𝑘)   𝐸(𝑘)   𝐹(𝑘)   𝐺(𝑘)   𝐻(𝑘)   𝐼(𝑘)   𝑁(𝑘)   𝑉(𝑘)   𝑊(𝑘)

Proof of Theorem wlkp1lem6

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		wlkp1.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		wlkp1.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
3		wlkp1.f	. . . 4 ⊢ (𝜑 → Fun 𝐼)
4		wlkp1.a	. . . 4 ⊢ (𝜑 → 𝐼 ∈ Fin)
5		wlkp1.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
6		wlkp1.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
7		wlkp1.d	. . . 4 ⊢ (𝜑 → ¬ 𝐵 ∈ dom 𝐼)
8		wlkp1.w	. . . 4 ⊢ (𝜑 → 𝐹(Walks‘𝐺)𝑃)
9		wlkp1.n	. . . 4 ⊢ 𝑁 = (♯‘𝐹)
10		wlkp1.e	. . . 4 ⊢ (𝜑 → 𝐸 ∈ (Edg‘𝐺))
11		wlkp1.x	. . . 4 ⊢ (𝜑 → {(𝑃‘𝑁), 𝐶} ⊆ 𝐸)
12		wlkp1.u	. . . 4 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐼 ∪ {⟨𝐵, 𝐸⟩}))
13		wlkp1.h	. . . 4 ⊢ 𝐻 = (𝐹 ∪ {⟨𝑁, 𝐵⟩})
14		wlkp1.q	. . . 4 ⊢ 𝑄 = (𝑃 ∪ {⟨(𝑁 + 1), 𝐶⟩})
15		wlkp1.s	. . . 4 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉)
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15	wlkp1lem5 29695	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥))
17		elfzofz 13715	. . . . . . 7 ⊢ (𝑘 ∈ (0..^𝑁) → 𝑘 ∈ (0...𝑁))
18	17	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑘 ∈ (0...𝑁))
19		fveq2 6906	. . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝑄‘𝑥) = (𝑄‘𝑘))
20		fveq2 6906	. . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝑃‘𝑥) = (𝑃‘𝑘))
21	19, 20	eqeq12d 2753	. . . . . . 7 ⊢ (𝑥 = 𝑘 → ((𝑄‘𝑥) = (𝑃‘𝑥) ↔ (𝑄‘𝑘) = (𝑃‘𝑘)))
22	21	rspcv 3618	. . . . . 6 ⊢ (𝑘 ∈ (0...𝑁) → (∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥) → (𝑄‘𝑘) = (𝑃‘𝑘)))
23	18, 22	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥) → (𝑄‘𝑘) = (𝑃‘𝑘)))
24	23	imp 406	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) ∧ ∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥)) → (𝑄‘𝑘) = (𝑃‘𝑘))
25		fzofzp1 13803	. . . . . . 7 ⊢ (𝑘 ∈ (0..^𝑁) → (𝑘 + 1) ∈ (0...𝑁))
26	25	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑘 + 1) ∈ (0...𝑁))
27		fveq2 6906	. . . . . . . 8 ⊢ (𝑥 = (𝑘 + 1) → (𝑄‘𝑥) = (𝑄‘(𝑘 + 1)))
28		fveq2 6906	. . . . . . . 8 ⊢ (𝑥 = (𝑘 + 1) → (𝑃‘𝑥) = (𝑃‘(𝑘 + 1)))
29	27, 28	eqeq12d 2753	. . . . . . 7 ⊢ (𝑥 = (𝑘 + 1) → ((𝑄‘𝑥) = (𝑃‘𝑥) ↔ (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1))))
30	29	rspcv 3618	. . . . . 6 ⊢ ((𝑘 + 1) ∈ (0...𝑁) → (∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥) → (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1))))
31	26, 30	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥) → (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1))))
32	31	imp 406	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) ∧ ∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥)) → (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)))
33	12	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (iEdg‘𝑆) = (𝐼 ∪ {⟨𝐵, 𝐸⟩}))
34	13	fveq1i 6907	. . . . . . . 8 ⊢ (𝐻‘𝑘) = ((𝐹 ∪ {⟨𝑁, 𝐵⟩})‘𝑘)
35		fzonel 13713	. . . . . . . . . . . . . 14 ⊢ ¬ 𝑁 ∈ (0..^𝑁)
36		eleq1 2829	. . . . . . . . . . . . . 14 ⊢ (𝑁 = 𝑘 → (𝑁 ∈ (0..^𝑁) ↔ 𝑘 ∈ (0..^𝑁)))
37	35, 36	mtbii 326	. . . . . . . . . . . . 13 ⊢ (𝑁 = 𝑘 → ¬ 𝑘 ∈ (0..^𝑁))
38	37	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑁 = 𝑘 → ¬ 𝑘 ∈ (0..^𝑁)))
39	38	con2d 134	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑘 ∈ (0..^𝑁) → ¬ 𝑁 = 𝑘))
40	39	imp 406	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ¬ 𝑁 = 𝑘)
41	40	neqned 2947	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝑁 ≠ 𝑘)
42		fvunsn 7199	. . . . . . . . 9 ⊢ (𝑁 ≠ 𝑘 → ((𝐹 ∪ {⟨𝑁, 𝐵⟩})‘𝑘) = (𝐹‘𝑘))
43	41, 42	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐹 ∪ {⟨𝑁, 𝐵⟩})‘𝑘) = (𝐹‘𝑘))
44	34, 43	eqtrid 2789	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝐻‘𝑘) = (𝐹‘𝑘))
45	33, 44	fveq12d 6913	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((iEdg‘𝑆)‘(𝐻‘𝑘)) = ((𝐼 ∪ {⟨𝐵, 𝐸⟩})‘(𝐹‘𝑘)))
46	9	oveq2i 7442	. . . . . . . . . . . . . . . 16 ⊢ (0..^𝑁) = (0..^(♯‘𝐹))
47	46	eleq2i 2833	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0..^𝑁) ↔ 𝑘 ∈ (0..^(♯‘𝐹)))
48	2	wlkf 29632	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼)
49	8, 48	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼)
50		wrdsymbcl 14565	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ∈ Word dom 𝐼 ∧ 𝑘 ∈ (0..^(♯‘𝐹))) → (𝐹‘𝑘) ∈ dom 𝐼)
51	50	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 ∈ Word dom 𝐼 → (𝑘 ∈ (0..^(♯‘𝐹)) → (𝐹‘𝑘) ∈ dom 𝐼))
52	49, 51	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑘 ∈ (0..^(♯‘𝐹)) → (𝐹‘𝑘) ∈ dom 𝐼))
53	47, 52	biimtrid 242	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑘 ∈ (0..^𝑁) → (𝐹‘𝑘) ∈ dom 𝐼))
54	53	imp 406	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝐹‘𝑘) ∈ dom 𝐼)
55		eleq1 2829	. . . . . . . . . . . . 13 ⊢ (𝐵 = (𝐹‘𝑘) → (𝐵 ∈ dom 𝐼 ↔ (𝐹‘𝑘) ∈ dom 𝐼))
56	54, 55	syl5ibrcom 247	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (𝐵 = (𝐹‘𝑘) → 𝐵 ∈ dom 𝐼))
57	56	con3d 152	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → (¬ 𝐵 ∈ dom 𝐼 → ¬ 𝐵 = (𝐹‘𝑘)))
58	57	ex 412	. . . . . . . . . 10 ⊢ (𝜑 → (𝑘 ∈ (0..^𝑁) → (¬ 𝐵 ∈ dom 𝐼 → ¬ 𝐵 = (𝐹‘𝑘))))
59	7, 58	mpid 44	. . . . . . . . 9 ⊢ (𝜑 → (𝑘 ∈ (0..^𝑁) → ¬ 𝐵 = (𝐹‘𝑘)))
60	59	imp 406	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ¬ 𝐵 = (𝐹‘𝑘))
61	60	neqned 2947	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → 𝐵 ≠ (𝐹‘𝑘))
62		fvunsn 7199	. . . . . . 7 ⊢ (𝐵 ≠ (𝐹‘𝑘) → ((𝐼 ∪ {⟨𝐵, 𝐸⟩})‘(𝐹‘𝑘)) = (𝐼‘(𝐹‘𝑘)))
63	61, 62	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐼 ∪ {⟨𝐵, 𝐸⟩})‘(𝐹‘𝑘)) = (𝐼‘(𝐹‘𝑘)))
64	45, 63	eqtrd 2777	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘)))
65	64	adantr 480	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) ∧ ∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥)) → ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘)))
66	24, 32, 65	3jca 1129	. . 3 ⊢ (((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) ∧ ∀𝑥 ∈ (0...𝑁)(𝑄‘𝑥) = (𝑃‘𝑥)) → ((𝑄‘𝑘) = (𝑃‘𝑘) ∧ (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)) ∧ ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘))))
67	16, 66	mpidan 689	. 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (0..^𝑁)) → ((𝑄‘𝑘) = (𝑃‘𝑘) ∧ (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)) ∧ ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘))))
68	67	ralrimiva 3146	1 ⊢ (𝜑 → ∀𝑘 ∈ (0..^𝑁)((𝑄‘𝑘) = (𝑃‘𝑘) ∧ (𝑄‘(𝑘 + 1)) = (𝑃‘(𝑘 + 1)) ∧ ((iEdg‘𝑆)‘(𝐻‘𝑘)) = (𝐼‘(𝐹‘𝑘))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108   ≠ wne 2940  ∀wral 3061   ∪ cun 3949   ⊆ wss 3951  {csn 4626  {cpr 4628  ⟨cop 4632   class class class wbr 5143  dom cdm 5685  Fun wfun 6555  ‘cfv 6561  (class class class)co 7431  Fincfn 8985  0cc0 11155  1c1 11156   + caddc 11158  ...cfz 13547  ..^cfzo 13694  ♯chash 14369  Word cword 14552  Vtxcvtx 29013  iEdgciedg 29014  Edgcedg 29064  Walkscwlks 29614

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232

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 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-card 9979  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-nn 12267  df-n0 12527  df-z 12614  df-uz 12879  df-fz 13548  df-fzo 13695  df-hash 14370  df-word 14553  df-wlks 29617

This theorem is referenced by:  wlkp1lem8  29698