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

Theorem wwlksnextsurj 29887
Description: Lemma for wwlksnextbij 29889. (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 29829 . . 3 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉))
3 simp2 1137 . . 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 29885 . . 3 (𝑁 ∈ ℕ0𝐹:𝐷𝑅)
92, 3, 83syl 18 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐹:𝐷𝑅)
10 preq2 4715 . . . . . 6 (𝑛 = 𝑟 → {(lastS‘𝑊), 𝑛} = {(lastS‘𝑊), 𝑟})
1110eleq1d 2820 . . . . 5 (𝑛 = 𝑟 → ({(lastS‘𝑊), 𝑛} ∈ 𝐸 ↔ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
1211, 6elrab2 3679 . . . 4 (𝑟𝑅 ↔ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸))
131, 4wwlksnext 29880 . . . . . . . . . . 11 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
14133expb 1120 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺))
15 s1cl 14625 . . . . . . . . . . . . . . . . . 18 (𝑟𝑉 → ⟨“𝑟”⟩ ∈ Word 𝑉)
16 pfxccat1 14725 . . . . . . . . . . . . . . . . . 18 ((𝑊 ∈ Word 𝑉 ∧ ⟨“𝑟”⟩ ∈ Word 𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
1715, 16sylan2 593 . . . . . . . . . . . . . . . . 17 ((𝑊 ∈ Word 𝑉𝑟𝑉) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊)
1817ex 412 . . . . . . . . . . . . . . . 16 (𝑊 ∈ Word 𝑉 → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
1918adantr 480 . . . . . . . . . . . . . . 15 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
20 oveq2 7418 . . . . . . . . . . . . . . . . . 18 ((𝑁 + 1) = (♯‘𝑊) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
2120eqcoms 2744 . . . . . . . . . . . . . . . . 17 ((♯‘𝑊) = (𝑁 + 1) → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)))
2221eqeq1d 2738 . . . . . . . . . . . . . . . 16 ((♯‘𝑊) = (𝑁 + 1) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
2322adantl 481 . . . . . . . . . . . . . . 15 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (♯‘𝑊)) = 𝑊))
2419, 23sylibrd 259 . . . . . . . . . . . . . 14 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1)) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
25243adant3 1132 . . . . . . . . . . . . 13 ((𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) = (𝑁 + 1) ∧ ∀𝑖 ∈ (0..^𝑁){(𝑊𝑖), (𝑊‘(𝑖 + 1))} ∈ 𝐸) → (𝑟𝑉 → ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
261, 4wwlknp 29830 . . . . . . . . . . . . 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 14657 . . . . . . . . . . . . . . . . . . 19 ((𝑊 ∈ Word 𝑉𝑟𝑉) → (lastS‘(𝑊 ++ ⟨“𝑟”⟩)) = 𝑟)
3130eqcomd 2742 . . . . . . . . . . . . . . . . . 18 ((𝑊 ∈ Word 𝑉𝑟𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
3231ex 412 . . . . . . . . . . . . . . . . 17 (𝑊 ∈ Word 𝑉 → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
33323ad2ant3 1135 . . . . . . . . . . . . . . . 16 ((𝐺 ∈ V ∧ 𝑁 ∈ ℕ0𝑊 ∈ Word 𝑉) → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
342, 33syl 17 . . . . . . . . . . . . . . 15 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (𝑟𝑉𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩))))
3534imp 406 . . . . . . . . . . . . . 14 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → 𝑟 = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
3635preq2d 4721 . . . . . . . . . . . . 13 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑉) → {(lastS‘𝑊), 𝑟} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
3736eleq1d 2820 . . . . . . . . . . . 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 7445 . . . . . . . . . 10 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → (𝑊 ++ ⟨“𝑟”⟩) ∈ V)
45 eleq1 2823 . . . . . . . . . . . . . . 15 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 ∈ ((𝑁 + 1) WWalksN 𝐺) ↔ (𝑊 ++ ⟨“𝑟”⟩) ∈ ((𝑁 + 1) WWalksN 𝐺)))
46 oveq1 7417 . . . . . . . . . . . . . . . . 17 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (𝑑 prefix (𝑁 + 1)) = ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)))
4746eqeq1d 2738 . . . . . . . . . . . . . . . 16 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → ((𝑑 prefix (𝑁 + 1)) = 𝑊 ↔ ((𝑊 ++ ⟨“𝑟”⟩) prefix (𝑁 + 1)) = 𝑊))
48 fveq2 6881 . . . . . . . . . . . . . . . . . 18 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → (lastS‘𝑑) = (lastS‘(𝑊 ++ ⟨“𝑟”⟩)))
4948preq2d 4721 . . . . . . . . . . . . . . . . 17 (𝑑 = (𝑊 ++ ⟨“𝑟”⟩) → {(lastS‘𝑊), (lastS‘𝑑)} = {(lastS‘𝑊), (lastS‘(𝑊 ++ ⟨“𝑟”⟩))})
5049eleq1d 2820 . . . . . . . . . . . . . . . 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 2747 . . . . . . . . . . . . . 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 3579 . . . . . . . . 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 7417 . . . . . . . . . . . . 13 (𝑤 = 𝑑 → (𝑤 prefix (𝑁 + 1)) = (𝑑 prefix (𝑁 + 1)))
6160eqeq1d 2738 . . . . . . . . . . . 12 (𝑤 = 𝑑 → ((𝑤 prefix (𝑁 + 1)) = 𝑊 ↔ (𝑑 prefix (𝑁 + 1)) = 𝑊))
62 fveq2 6881 . . . . . . . . . . . . . 14 (𝑤 = 𝑑 → (lastS‘𝑤) = (lastS‘𝑑))
6362preq2d 4721 . . . . . . . . . . . . 13 (𝑤 = 𝑑 → {(lastS‘𝑊), (lastS‘𝑤)} = {(lastS‘𝑊), (lastS‘𝑑)})
6463eleq1d 2820 . . . . . . . . . . . 12 (𝑤 = 𝑑 → ({(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸 ↔ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸))
6561, 64anbi12d 632 . . . . . . . . . . 11 (𝑤 = 𝑑 → (((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸) ↔ ((𝑑 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑑)} ∈ 𝐸)))
6665elrab 3676 . . . . . . . . . 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 1848 . . . . . . . 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 3062 . . . . . . 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 29884 . . . . . . 7 (𝑊 ∈ (𝑁 WWalksN 𝐺) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
7372adantr 480 . . . . . 6 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → 𝐷 = {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)})
7471, 73rexeqtrrdv 3314 . . . . 5 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑𝐷 𝑟 = (lastS‘𝑑))
75 fveq2 6881 . . . . . . . 8 (𝑡 = 𝑑 → (lastS‘𝑡) = (lastS‘𝑑))
76 fvex 6894 . . . . . . . 8 (lastS‘𝑑) ∈ V
7775, 7, 76fvmpt 6991 . . . . . . 7 (𝑑𝐷 → (𝐹𝑑) = (lastS‘𝑑))
7877eqeq2d 2747 . . . . . 6 (𝑑𝐷 → (𝑟 = (𝐹𝑑) ↔ 𝑟 = (lastS‘𝑑)))
7978rexbiia 3082 . . . . 5 (∃𝑑𝐷 𝑟 = (𝐹𝑑) ↔ ∃𝑑𝐷 𝑟 = (lastS‘𝑑))
8074, 79sylibr 234 . . . 4 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ (𝑟𝑉 ∧ {(lastS‘𝑊), 𝑟} ∈ 𝐸)) → ∃𝑑𝐷 𝑟 = (𝐹𝑑))
8112, 80sylan2b 594 . . 3 ((𝑊 ∈ (𝑁 WWalksN 𝐺) ∧ 𝑟𝑅) → ∃𝑑𝐷 𝑟 = (𝐹𝑑))
8281ralrimiva 3133 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∀𝑟𝑅𝑑𝐷 𝑟 = (𝐹𝑑))
83 dffo3 7097 . 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 1540  wex 1779  wcel 2109  wral 3052  wrex 3061  {crab 3420  Vcvv 3464  {cpr 4608  cmpt 5206  wf 6532  ontowfo 6534  cfv 6536  (class class class)co 7410  0cc0 11134  1c1 11135   + caddc 11137  2c2 12300  0cn0 12506  ..^cfzo 13676  chash 14353  Word cword 14536  lastSclsw 14585   ++ cconcat 14593  ⟨“cs1 14618   prefix cpfx 14693  Vtxcvtx 28980  Edgcedg 29031   WWalksN cwwlksn 29813
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734  ax-cnex 11190  ax-resscn 11191  ax-1cn 11192  ax-icn 11193  ax-addcl 11194  ax-addrcl 11195  ax-mulcl 11196  ax-mulrcl 11197  ax-mulcom 11198  ax-addass 11199  ax-mulass 11200  ax-distr 11201  ax-i2m1 11202  ax-1ne0 11203  ax-1rid 11204  ax-rnegex 11205  ax-rrecex 11206  ax-cnre 11207  ax-pre-lttri 11208  ax-pre-lttrn 11209  ax-pre-ltadd 11210  ax-pre-mulgt0 11211
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-1o 8485  df-er 8724  df-map 8847  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-card 9958  df-pnf 11276  df-mnf 11277  df-xr 11278  df-ltxr 11279  df-le 11280  df-sub 11473  df-neg 11474  df-nn 12246  df-2 12308  df-n0 12507  df-xnn0 12580  df-z 12594  df-uz 12858  df-rp 13014  df-fz 13530  df-fzo 13677  df-hash 14354  df-word 14537  df-lsw 14586  df-concat 14594  df-s1 14619  df-substr 14664  df-pfx 14694  df-wwlks 29817  df-wwlksn 29818
This theorem is referenced by:  wwlksnextbij0  29888
  Copyright terms: Public domain W3C validator