Theorem clwlkclwwlkf1 30372

Description: 𝐹 is a one-to-one function from the nonempty closed walks into the closed walks as words in a simple pseudograph. (Contributed by Alexander van der Vekens, 5-Jul-2018.) (Revised by AV, 3-May-2021.) (Revised by AV, 29-Oct-2022.)

Hypotheses

Ref	Expression
clwlkclwwlkf.c	⊢ 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))}
clwlkclwwlkf.f	⊢ 𝐹 = (𝑐 ∈ 𝐶 ↦ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)))

Assertion

Ref	Expression
clwlkclwwlkf1	⊢ (𝐺 ∈ USPGraph → 𝐹:𝐶–1-1→(ClWWalks‘𝐺))

Distinct variable groups:   𝑤,𝐺,𝑐   𝐶,𝑐,𝑤   𝐹,𝑐,𝑤

Proof of Theorem clwlkclwwlkf1

Dummy variables 𝑖 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		clwlkclwwlkf.c	. . 3 ⊢ 𝐶 = {𝑤 ∈ (ClWalks‘𝐺) ∣ 1 ≤ (♯‘(1st ‘𝑤))}
2		clwlkclwwlkf.f	. . 3 ⊢ 𝐹 = (𝑐 ∈ 𝐶 ↦ ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)))
3	1, 2	clwlkclwwlkf 30370	. 2 ⊢ (𝐺 ∈ USPGraph → 𝐹:𝐶⟶(ClWWalks‘𝐺))
4		fveq2 6881	. . . . . . . 8 ⊢ (𝑐 = 𝑥 → (2nd ‘𝑐) = (2nd ‘𝑥))
5		2fveq3 6886	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (♯‘(2nd ‘𝑐)) = (♯‘(2nd ‘𝑥)))
6	5	oveq1d 7427	. . . . . . . 8 ⊢ (𝑐 = 𝑥 → ((♯‘(2nd ‘𝑐)) − 1) = ((♯‘(2nd ‘𝑥)) − 1))
7	4, 6	oveq12d 7430	. . . . . . 7 ⊢ (𝑐 = 𝑥 → ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) = ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)))
8		id 23	. . . . . . 7 ⊢ (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐶)
9		ovexd 7447	. . . . . . 7 ⊢ (𝑥 ∈ 𝐶 → ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) ∈ V)
10	2, 7, 8, 9	fvmptd3 7013	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → (𝐹‘𝑥) = ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)))
11		fveq2 6881	. . . . . . . 8 ⊢ (𝑐 = 𝑦 → (2nd ‘𝑐) = (2nd ‘𝑦))
12		2fveq3 6886	. . . . . . . . 9 ⊢ (𝑐 = 𝑦 → (♯‘(2nd ‘𝑐)) = (♯‘(2nd ‘𝑦)))
13	12	oveq1d 7427	. . . . . . . 8 ⊢ (𝑐 = 𝑦 → ((♯‘(2nd ‘𝑐)) − 1) = ((♯‘(2nd ‘𝑦)) − 1))
14	11, 13	oveq12d 7430	. . . . . . 7 ⊢ (𝑐 = 𝑦 → ((2nd ‘𝑐) prefix ((♯‘(2nd ‘𝑐)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)))
15		id 23	. . . . . . 7 ⊢ (𝑦 ∈ 𝐶 → 𝑦 ∈ 𝐶)
16		ovexd 7447	. . . . . . 7 ⊢ (𝑦 ∈ 𝐶 → ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)) ∈ V)
17	2, 14, 15, 16	fvmptd3 7013	. . . . . 6 ⊢ (𝑦 ∈ 𝐶 → (𝐹‘𝑦) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)))
18	10, 17	eqeqan12d 2776	. . . . 5 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))))
19	18	adantl 486	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))))
20		simplrl 788	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → 𝑥 ∈ 𝐶)
21		simplrr 789	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → 𝑦 ∈ 𝐶)
22		eqid 2762	. . . . . . . . . . . . . . 15 ⊢ (1st ‘𝑥) = (1st ‘𝑥)
23		eqid 2762	. . . . . . . . . . . . . . 15 ⊢ (2nd ‘𝑥) = (2nd ‘𝑥)
24	1, 22, 23	clwlkclwwlkflem 30366	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐶 → ((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) ∧ ((2nd ‘𝑥)‘0) = ((2nd ‘𝑥)‘(♯‘(1st ‘𝑥))) ∧ (♯‘(1st ‘𝑥)) ∈ ℕ))
25		wlklenvm1 29982	. . . . . . . . . . . . . . . 16 ⊢ ((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) → (♯‘(1st ‘𝑥)) = ((♯‘(2nd ‘𝑥)) − 1))
26	25	eqcomd 2768	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) → ((♯‘(2nd ‘𝑥)) − 1) = (♯‘(1st ‘𝑥)))
27	26	3ad2ant1 1150	. . . . . . . . . . . . . 14 ⊢ (((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) ∧ ((2nd ‘𝑥)‘0) = ((2nd ‘𝑥)‘(♯‘(1st ‘𝑥))) ∧ (♯‘(1st ‘𝑥)) ∈ ℕ) → ((♯‘(2nd ‘𝑥)) − 1) = (♯‘(1st ‘𝑥)))
28	24, 27	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐶 → ((♯‘(2nd ‘𝑥)) − 1) = (♯‘(1st ‘𝑥)))
29	28	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((♯‘(2nd ‘𝑥)) − 1) = (♯‘(1st ‘𝑥)))
30	29	oveq2d 7428	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))))
31		eqid 2762	. . . . . . . . . . . . . . 15 ⊢ (1st ‘𝑦) = (1st ‘𝑦)
32		eqid 2762	. . . . . . . . . . . . . . 15 ⊢ (2nd ‘𝑦) = (2nd ‘𝑦)
33	1, 31, 32	clwlkclwwlkflem 30366	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐶 → ((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) ∧ ((2nd ‘𝑦)‘0) = ((2nd ‘𝑦)‘(♯‘(1st ‘𝑦))) ∧ (♯‘(1st ‘𝑦)) ∈ ℕ))
34		wlklenvm1 29982	. . . . . . . . . . . . . . . 16 ⊢ ((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) → (♯‘(1st ‘𝑦)) = ((♯‘(2nd ‘𝑦)) − 1))
35	34	eqcomd 2768	. . . . . . . . . . . . . . 15 ⊢ ((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) → ((♯‘(2nd ‘𝑦)) − 1) = (♯‘(1st ‘𝑦)))
36	35	3ad2ant1 1150	. . . . . . . . . . . . . 14 ⊢ (((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) ∧ ((2nd ‘𝑦)‘0) = ((2nd ‘𝑦)‘(♯‘(1st ‘𝑦))) ∧ (♯‘(1st ‘𝑦)) ∈ ℕ) → ((♯‘(2nd ‘𝑦)) − 1) = (♯‘(1st ‘𝑦)))
37	33, 36	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝐶 → ((♯‘(2nd ‘𝑦)) − 1) = (♯‘(1st ‘𝑦)))
38	37	adantl 486	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((♯‘(2nd ‘𝑦)) − 1) = (♯‘(1st ‘𝑦)))
39	38	oveq2d 7428	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦))))
40	30, 39	eqeq12d 2778	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)) ↔ ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦)))))
41	40	adantl 486	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)) ↔ ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦)))))
42	41	biimpa 481	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦))))
43	20, 21, 42	3jca 1145	. . . . . . 7 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶 ∧ ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦)))))
44	1, 22, 23, 31, 32	clwlkclwwlkf1lem2 30367	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶 ∧ ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦)))) → ((♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)) ∧ ∀𝑖 ∈ (0..^(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖)))
45		simpl 487	. . . . . . 7 ⊢ (((♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)) ∧ ∀𝑖 ∈ (0..^(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖)) → (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)))
46	43, 44, 45	3syl 19	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)))
47	1, 22, 23, 31, 32	clwlkclwwlkf1lem3 30368	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶 ∧ ((2nd ‘𝑥) prefix (♯‘(1st ‘𝑥))) = ((2nd ‘𝑦) prefix (♯‘(1st ‘𝑦)))) → ∀𝑖 ∈ (0...(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖))
48	43, 47	syl 18	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → ∀𝑖 ∈ (0...(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖))
49		simpl 487	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝐺 ∈ USPGraph)
50		wlkcpr 29989	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (Walks‘𝐺) ↔ (1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥))
51	50	biimpri 231	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) → 𝑥 ∈ (Walks‘𝐺))
52	51	3ad2ant1 1150	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑥)(Walks‘𝐺)(2nd ‘𝑥) ∧ ((2nd ‘𝑥)‘0) = ((2nd ‘𝑥)‘(♯‘(1st ‘𝑥))) ∧ (♯‘(1st ‘𝑥)) ∈ ℕ) → 𝑥 ∈ (Walks‘𝐺))
53	24, 52	syl 18	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐶 → 𝑥 ∈ (Walks‘𝐺))
54		wlkcpr 29989	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (Walks‘𝐺) ↔ (1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦))
55	54	biimpri 231	. . . . . . . . . . . . 13 ⊢ ((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) → 𝑦 ∈ (Walks‘𝐺))
56	55	3ad2ant1 1150	. . . . . . . . . . . 12 ⊢ (((1st ‘𝑦)(Walks‘𝐺)(2nd ‘𝑦) ∧ ((2nd ‘𝑦)‘0) = ((2nd ‘𝑦)‘(♯‘(1st ‘𝑦))) ∧ (♯‘(1st ‘𝑦)) ∈ ℕ) → 𝑦 ∈ (Walks‘𝐺))
57	33, 56	syl 18	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐶 → 𝑦 ∈ (Walks‘𝐺))
58	53, 57	anim12i 624	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)))
59	58	adantl 486	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)))
60		eqidd 2763	. . . . . . . . 9 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑥)))
61	49, 59, 60	3jca 1145	. . . . . . . 8 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) ∧ (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑥))))
62	61	adantr 485	. . . . . . 7 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → (𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) ∧ (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑥))))
63		uspgr2wlkeq 30006	. . . . . . 7 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ (Walks‘𝐺) ∧ 𝑦 ∈ (Walks‘𝐺)) ∧ (♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑥))) → (𝑥 = 𝑦 ↔ ((♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)) ∧ ∀𝑖 ∈ (0...(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖))))
64	62, 63	syl 18	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → (𝑥 = 𝑦 ↔ ((♯‘(1st ‘𝑥)) = (♯‘(1st ‘𝑦)) ∧ ∀𝑖 ∈ (0...(♯‘(1st ‘𝑥)))((2nd ‘𝑥)‘𝑖) = ((2nd ‘𝑦)‘𝑖))))
65	46, 48, 64	mpbir2and 725	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) ∧ ((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1))) → 𝑥 = 𝑦)
66	65	ex 417	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (((2nd ‘𝑥) prefix ((♯‘(2nd ‘𝑥)) − 1)) = ((2nd ‘𝑦) prefix ((♯‘(2nd ‘𝑦)) − 1)) → 𝑥 = 𝑦))
67	19, 66	sylbid 243	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
68	67	ralrimivva 3207	. 2 ⊢ (𝐺 ∈ USPGraph → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
69		dff13 7252	. 2 ⊢ (𝐹:𝐶–1-1→(ClWWalks‘𝐺) ↔ (𝐹:𝐶⟶(ClWWalks‘𝐺) ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
70	3, 68, 69	sylanbrc 594	1 ⊢ (𝐺 ∈ USPGraph → 𝐹:𝐶–1-1→(ClWWalks‘𝐺))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∀wral 3078  {crab 3415  Vcvv 3454   class class class wbr 5108   ↦ cmpt 5191  ⟶wf 6532  –1-1→wf1 6533  ‘cfv 6536  (class class class)co 7412  1^st c1st 7982  2^nd c2nd 7983  0cc0 11106  1c1 11107   ≤ cle 11250   − cmin 11447  ℕcn 12239  ...cfz 13541  ..^cfzo 13689  ♯chash 14373   prefix cpfx 14715  USPGraphcuspgr 29509  Walkscwlks 29957  ClWalkscclwlks 30130  ClWWalkscclwwlk 30343

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ifp 1078  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  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 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-1o 8451  df-2o 8452  df-oadd 8455  df-er 8692  df-map 8824  df-pm 8825  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-dju 9894  df-card 9932  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-le 11255  df-sub 11449  df-neg 11450  df-nn 12240  df-2 12309  df-n0 12511  df-xnn0 12584  df-z 12598  df-uz 12869  df-fz 13542  df-fzo 13690  df-hash 14374  df-word 14558  df-lsw 14607  df-substr 14686  df-pfx 14716  df-edg 29409  df-uhgr 29419  df-upgr 29443  df-uspgr 29511  df-wlks 29960  df-clwlks 30131  df-clwwlk 30344

This theorem is used by:  clwlkclwwlkf1o  30373