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

Theorem wwlksnextsurj 29930
Description: Lemma for wwlksnextbij 29932. (Contributed by Alexander van der Vekens, 7-Aug-2018.) (Revised by AV, 18-Apr-2021.) (Revised by AV, 27-Oct-2022.)
Hypotheses
Ref Expression
wwlksnextbij0.v 𝑉 = (Vtx‘𝐺)
wwlksnextbij0.e 𝐸 = (Edg‘𝐺)
wwlksnextbij0.d 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
wwlksnextbij0.r 𝑅 = {𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}
wwlksnextbij0.f 𝐹 = (𝑡𝐷 ↦ (lastS‘𝑡))
Assertion
Ref Expression
wwlksnextsurj (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷onto𝑅)
Distinct variable groups:   𝑤,𝐺   𝑤,𝑁   𝑤,𝑊   𝑡,𝐷   𝑛,𝐸,𝑤   𝑡,𝑁,𝑤   𝑡,𝑅   𝑛,𝑉,𝑤   𝑛,𝑊   𝑡,𝑛,𝑁,𝑤
Allowed substitution hints:   𝐷(𝑤,𝑛)   𝑅(𝑤,𝑛)   𝐸(𝑡)   𝐹(𝑤,𝑡,𝑛)   𝐺(𝑡,𝑛)   𝑉(𝑡)   𝑊(𝑡)

Proof of Theorem wwlksnextsurj
Dummy variables 𝑖 𝑑 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wwlksnextbij0.v . . . 4 𝑉 = (Vtx‘𝐺)
21wwlknbp 29872 . . 3 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉))
3 simp2 1136 . . 3 ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉) → 𝑁 ∈ ℕ0)
4 wwlksnextbij0.e . . . 4 𝐸 = (Edg‘𝐺)
5 wwlksnextbij0.d . . . 4 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = (𝑁 + 2) ∧ (𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}
6 wwlksnextbij0.r . . . 4 𝑅 = {𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}
7 wwlksnextbij0.f . . . 4 𝐹 = (𝑡𝐷 ↦ (lastS‘𝑡))
81, 4, 5, 6, 7wwlksnextfun 29928 . . 3 (𝑁 ∈ ℕ0𝐹:𝐷𝑅)
92, 3, 83syl 18 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷𝑅)
10 preq2 4739 . . . . . 6 (𝑛 = 𝑟 → {(lastS‘𝑊), 𝑛} = {(lastS‘𝑊), 𝑟})
1110eleq1d 2824 . . . . 5 (𝑛 = 𝑟 → ({(lastS‘𝑊), 𝑛} ∈ 𝐸 ↔ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
1211, 6elrab2 3698 . . . 4 (𝑟𝑅 ↔ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
131, 4wwlksnext 29923 . . . . . . . . . . 11 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
14133expb 1119 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
15 s1cl 14637 . . . . . . . . . . . . . . . . . 18 (𝑟𝑉 → ⟨“𝑟”⟩ ∈ Word 𝑉)
16 pfxccat1 14737 . . . . . . . . . . . . . . . . . 18 ((𝑊 ∈ Word 𝑉 ∧ ⟨“𝑟”⟩ ∈ Word 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
1715, 16sylan2 593 . . . . . . . . . . . . . . . . 17 ((𝑊 ∈ Word 𝑉𝑟𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
1817ex 412 . . . . . . . . . . . . . . . 16 (𝑊 ∈ Word 𝑉 → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
1918adantr 480 . . . . . . . . . . . . . . 15 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
20 oveq2 7439 . . . . . . . . . . . . . . . . . 18 ((𝑁 + 1) = (♯‘𝑊) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
2120eqcoms 2743 . . . . . . . . . . . . . . . . 17 ((♯‘𝑊) = (𝑁 + 1) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
2221eqeq1d 2737 . . . . . . . . . . . . . . . 16 ((♯‘𝑊) = (𝑁 + 1) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
2322adantl 481 . . . . . . . . . . . . . . 15 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
2419, 23sylibrd 259 . . . . . . . . . . . . . 14 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
25243adant3 1131 . . . . . . . . . . . . 13 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
261, 4wwlknp 29873 . . . . . . . . . . . . 13 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸))
2725, 26syl11 33 . . . . . . . . . . . 12 (𝑟𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
2827adantr 480 . . . . . . . . . . 11 ((𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
2928impcom 407 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊)
30 lswccats1 14669 . . . . . . . . . . . . . . . . . . 19 ((𝑊 ∈ Word 𝑉𝑟𝑉) → (lastS‘(𝑊 ++ ⟨“𝑟”⟩)) = 𝑟)
3130eqcomd 2741 . . . . . . . . . . . . . . . . . 18 ((𝑊 ∈ Word 𝑉𝑟𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
3231ex 412 . . . . . . . . . . . . . . . . 17 (𝑊 ∈ Word 𝑉 → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
33323ad2ant3 1134 . . . . . . . . . . . . . . . 16 ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉) → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
342, 33syl 17 . . . . . . . . . . . . . . 15 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
3534imp 406 . . . . . . . . . . . . . 14 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
3635preq2d 4745 . . . . . . . . . . . . 13 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → {(lastS‘𝑊), 𝑟} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
3736eleq1d 2824 . . . . . . . . . . . 12 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
3837biimpd 229 . . . . . . . . . . 11 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → ({(lastS‘𝑊), 𝑟} ∈ 𝐸 → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
3938impr 454 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)
4014, 29, 39jca32 515 . . . . . . . . 9 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
4133, 2syl11 33 . . . . . . . . . . 11 (𝑟𝑉 → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
4241adantr 480 . . . . . . . . . 10 ((𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
4342impcom 407 . . . . . . . . 9 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
44 ovexd 7466 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ V)
45 eleq1 2827 . . . . . . . . . . . . . . 15 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺)))
46 oveq1 7438 . . . . . . . . . . . . . . . . 17 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)))
4746eqeq1d 2737 . . . . . . . . . . . . . . . 16 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
48 fveq2 6907 . . . . . . . . . . . . . . . . . 18 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (lastS‘𝑑) = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
4948preq2d 4745 . . . . . . . . . . . . . . . . 17 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → {(lastS‘𝑊), (lastS‘𝑑)} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
5049eleq1d 2824 . . . . . . . . . . . . . . . 16 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ({(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))
5147, 50anbi12d 632 . . . . . . . . . . . . . . 15 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸) ↔ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)))
5245, 51anbi12d 632 . . . . . . . . . . . . . 14 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ↔ ((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸))))
5348eqeq2d 2746 . . . . . . . . . . . . . 14 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑟 = (lastS‘𝑑) ↔ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
5452, 53anbi12d 632 . . . . . . . . . . . . 13 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)) ↔ (((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))))
5554bicomd 223 . . . . . . . . . . . 12 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
5655adantl 481 . . . . . . . . . . 11 (((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) ∧ 𝑑 = (𝑊 ++ ⟨“𝑟”⟩)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
5756biimpd 229 . . . . . . . . . 10 (((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) ∧ 𝑑 = (𝑊 ++ ⟨“𝑟”⟩)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) → ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
5844, 57spcimedv 3595 . . . . . . . . 9 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ((((𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))} ∈ 𝐸)) ∧ 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑))))
5940, 43, 58mp2and 699 . . . . . . . 8 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
60 oveq1 7438 . . . . . . . . . . . . 13 (𝑤 = 𝑑 → (𝑤 prefix (𝑁 + 1)) = (𝑑 prefix (𝑁 + 1)))
6160eqeq1d 2737 . . . . . . . . . . . 12 (𝑤 = 𝑑 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑑 prefix (𝑁 + 1)) = 𝑊))
62 fveq2 6907 . . . . . . . . . . . . . 14 (𝑤 = 𝑑 → (lastS‘𝑤) = (lastS‘𝑑))
6362preq2d 4745 . . . . . . . . . . . . 13 (𝑤 = 𝑑 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑑)})
6463eleq1d 2824 . . . . . . . . . . . 12 (𝑤 = 𝑑 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸))
6561, 64anbi12d 632 . . . . . . . . . . 11 (𝑤 = 𝑑 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
6665elrab 3695 . . . . . . . . . 10 (𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ↔ (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
6766anbi1i 624 . . . . . . . . 9 ((𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)) ↔ ((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
6867exbii 1845 . . . . . . . 8 (∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)) ↔ ∃𝑑((𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ∧ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)) ∧ 𝑟 = (lastS‘𝑑)))
6959, 68sylibr 234 . . . . . . 7 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)))
70 df-rex 3069 . . . . . . 7 (∃𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}𝑟 = (lastS‘𝑑) ↔ ∃𝑑(𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∧ 𝑟 = (lastS‘𝑑)))
7169, 70sylibr 234 . . . . . 6 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑 ∈ {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}𝑟 = (lastS‘𝑑))
721, 4, 5wwlksnextwrd 29927 . . . . . . 7 (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
7372adantr 480 . . . . . 6 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
7471, 73rexeqtrrdv 3329 . . . . 5 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑𝐷 𝑟 = (lastS‘𝑑))
75 fveq2 6907 . . . . . . . 8 (𝑡 = 𝑑 → (lastS‘𝑡) = (lastS‘𝑑))
76 fvex 6920 . . . . . . . 8 (lastS‘𝑑) ∈ V
7775, 7, 76fvmpt 7016 . . . . . . 7 (𝑑𝐷 → (𝐹𝑑) = (lastS‘𝑑))
7877eqeq2d 2746 . . . . . 6 (𝑑𝐷 → (𝑟 = (𝐹𝑑) ↔ 𝑟 = (lastS‘𝑑)))
7978rexbiia 3090 . . . . 5 (∃𝑑𝐷 𝑟 = (𝐹𝑑) ↔ ∃𝑑𝐷 𝑟 = (lastS‘𝑑))
8074, 79sylibr 234 . . . 4 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑𝐷 𝑟 = (𝐹𝑑))
8112, 80sylan2b 594 . . 3 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑅) → ∃𝑑𝐷 𝑟 = (𝐹𝑑))
8281ralrimiva 3144 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∀𝑟𝑅𝑑𝐷 𝑟 = (𝐹𝑑))
83 dffo3 7122 . 2 (𝐹:𝐷onto𝑅 ↔ (𝐹:𝐷𝑅 ∧ ∀𝑟𝑅𝑑𝐷 𝑟 = (𝐹𝑑)))
849, 82, 83sylanbrc 583 1 (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷onto𝑅)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wex 1776  wcel 2106  wral 3059  wrex 3068  {crab 3433  Vcvv 3478  {cpr 4633  cmpt 5231  wf 6559  ontowfo 6561  cfv 6563  (class class class)co 7431  0cc0 11153  1c1 11154   + caddc 11156  2c2 12319  0cn0 12524  ..^cfzo 13691  chash 14366  Word cword 14549  lastSclsw 14597   ++ cconcat 14605  ⟨“cs1 14630   prefix cpfx 14705  Vtxcvtx 29028  Edgcedg 29079   WWalksN cwwlksn 29856
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-map 8867  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-2 12327  df-n0 12525  df-xnn0 12598  df-z 12612  df-uz 12877  df-rp 13033  df-fz 13545  df-fzo 13692  df-hash 14367  df-word 14550  df-lsw 14598  df-concat 14606  df-s1 14631  df-substr 14676  df-pfx 14706  df-wwlks 29860  df-wwlksn 29861
This theorem is referenced by:  wwlksnextbij0  29931
  Copyright terms: Public domain W3C validator