numclwlk2lem2f1o - Metamath Proof Explorer

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

Theorem numclwlk2lem2f1o 29621

Description: 𝑅 is a 1-1 onto function. (Contributed by Alexander van der Vekens, 6-Oct-2018.) (Revised by AV, 21-Jan-2022.) (Proof shortened by AV, 17-Mar-2022.) (Revised by AV, 1-Nov-2022.)

**Hypotheses**
Ref	Expression
numclwwlk.v	⊢ 𝑉 = (Vtx‘𝐺)
numclwwlk.q	⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})
numclwwlk.h	⊢ 𝐻 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ_≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
numclwwlk.r	⊢ 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 prefix (𝑁 + 1)))

**Assertion**
Ref	Expression
numclwlk2lem2f1o	⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝑅:(𝑋𝐻(𝑁 + 2))–1-1-onto→(𝑋𝑄𝑁))

Distinct variable groups: 𝑛,𝐺,𝑣,𝑤 𝑛,𝑁,𝑣,𝑤 𝑛,𝑉,𝑣 𝑛,𝑋,𝑣,𝑤 𝑤,𝑉 𝑥,𝐺,𝑤 𝑥,𝐻 𝑥,𝑁 𝑥,𝑄 𝑥,𝑉 𝑥,𝑋,𝑣 Allowed substitution hints: 𝑄(𝑤,𝑣,𝑛) 𝑅(𝑥,𝑤,𝑣,𝑛) 𝐻(𝑤,𝑣,𝑛)

Proof of Theorem numclwlk2lem2f1o Dummy variables 𝑦 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1w 2816	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ (𝑋𝐻(𝑁 + 2)) ↔ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))))
2		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑅‘𝑦) = (𝑅‘𝑥))
3		oveq1 7412	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑦 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)))
4	2, 3	eqeq12d 2748	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → ((𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1)) ↔ (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
5	1, 4	imbi12d 344	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1))) ↔ (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1)))))
6	5	imbi2d 340	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑦 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1)))) ↔ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))))
7		numclwwlk.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
8		numclwwlk.q	. . . . . . . 8 ⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})
9		numclwwlk.h	. . . . . . . 8 ⊢ 𝐻 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ_≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
10		numclwwlk.r	. . . . . . . 8 ⊢ 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 prefix (𝑁 + 1)))
11	7, 8, 9, 10	numclwlk2lem2fv 29620	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑦 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1))))
12	6, 11	chvarvv 2002	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
13	12	3adant1 1130	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
14	13	imp 407	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1)))
15	7, 8, 9, 10	numclwlk2lem2f 29619	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝑅:(𝑋𝐻(𝑁 + 2))⟶(𝑋𝑄𝑁))
16	15	ffvelcdmda 7083	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅‘𝑥) ∈ (𝑋𝑄𝑁))
17	14, 16	eqeltrrd 2834	. . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑥 prefix (𝑁 + 1)) ∈ (𝑋𝑄𝑁))
18	17	ralrimiva 3146	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 prefix (𝑁 + 1)) ∈ (𝑋𝑄𝑁))
19	7, 8, 9	numclwwlk2lem1 29618	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) → ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))))
20	19	imp 407	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑢 ∈ (𝑋𝑄𝑁)) → ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)))
21	7, 8	numclwwlkovq 29616	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})
22	21	eleq2d 2819	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ 𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)}))
23	22	3adant1 1130	. . . . . . 7 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ 𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)}))
24		fveq1 6887	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → (𝑤‘0) = (𝑢‘0))
25	24	eqeq1d 2734	. . . . . . . . 9 ⊢ (𝑤 = 𝑢 → ((𝑤‘0) = 𝑋 ↔ (𝑢‘0) = 𝑋))
26		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → (lastS‘𝑤) = (lastS‘𝑢))
27	26	neeq1d 3000	. . . . . . . . 9 ⊢ (𝑤 = 𝑢 → ((lastS‘𝑤) ≠ 𝑋 ↔ (lastS‘𝑢) ≠ 𝑋))
28	25, 27	anbi12d 631	. . . . . . . 8 ⊢ (𝑤 = 𝑢 → (((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋) ↔ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)))
29	28	elrab 3682	. . . . . . 7 ⊢ (𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)} ↔ (𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)))
30	23, 29	bitrdi 286	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ (𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋))))
31		wwlknbp1 29087	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑁 ∈ ℕ₀ ∧ 𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
32		3simpc 1150	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)) → (𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
33	31, 32	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
34	7	wrdeqi 14483	. . . . . . . . . . . . . . . . 17 ⊢ Word 𝑉 = Word (Vtx‘𝐺)
35	34	eleq2i 2825	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ Word 𝑉 ↔ 𝑢 ∈ Word (Vtx‘𝐺))
36	35	anbi1i 624	. . . . . . . . . . . . . . 15 ⊢ ((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ↔ (𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
37	33, 36	sylibr 233	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)))
38		simpll 765	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → 𝑢 ∈ Word 𝑉)
39		nnnn0 12475	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
40		2nn 12281	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 2 ∈ ℕ
41	40	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℕ)
42	41	nnzd 12581	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℤ)
43		nn0pzuz 12885	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ ℕ₀ ∧ 2 ∈ ℤ) → (𝑁 + 2) ∈ (ℤ_≥‘2))
44	39, 42, 43	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) ∈ (ℤ_≥‘2))
45	9	numclwwlkovh 29615	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑁 + 2) ∈ (ℤ_≥‘2)) → (𝑋𝐻(𝑁 + 2)) = {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))})
46	44, 45	sylan2 593	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝐻(𝑁 + 2)) = {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))})
47	46	eleq2d 2819	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ 𝑥 ∈ {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))}))
48		fveq1 6887	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = 𝑥 → (𝑤‘0) = (𝑥‘0))
49	48	eqeq1d 2734	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → ((𝑤‘0) = 𝑋 ↔ (𝑥‘0) = 𝑋))
50		fveq1 6887	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = 𝑥 → (𝑤‘((𝑁 + 2) − 2)) = (𝑥‘((𝑁 + 2) − 2)))
51	50, 48	neeq12d 3002	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → ((𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0) ↔ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))
52	49, 51	anbi12d 631	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑥 → (((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0)) ↔ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))))
53	52	elrab 3682	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))} ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))))
54	47, 53	bitrdi 286	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))))
55	54	3adant1 1130	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))))
56	55	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))))
57	7	clwwlknbp 29277	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = (𝑁 + 2)))
58		lencl 14479	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑢 ∈ Word 𝑉 → (♯‘𝑢) ∈ ℕ₀)
59		simprr 771	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → 𝑥 ∈ Word 𝑉)
60		df-2 12271	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ⊢ 2 = (1 + 1)
61	60	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 2 = (1 + 1))
62	61	oveq2d 7421	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) = (𝑁 + (1 + 1)))
63		nncn 12216	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
64		1cnd 11205	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℂ)
65	63, 64, 64	addassd 11232	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1)))
66	62, 65	eqtr4d 2775	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) = ((𝑁 + 1) + 1))
67	66	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) → (𝑁 + 2) = ((𝑁 + 1) + 1))
68	67	eqeq2d 2743	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) → ((♯‘𝑥) = (𝑁 + 2) ↔ (♯‘𝑥) = ((𝑁 + 1) + 1)))
69	68	biimpcd 248	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((♯‘𝑥) = (𝑁 + 2) → ((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) → (♯‘𝑥) = ((𝑁 + 1) + 1)))
70	69	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → ((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) → (♯‘𝑥) = ((𝑁 + 1) + 1)))
71	70	impcom 408	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → (♯‘𝑥) = ((𝑁 + 1) + 1))
72		oveq1 7412	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((♯‘𝑢) = (𝑁 + 1) → ((♯‘𝑢) + 1) = ((𝑁 + 1) + 1))
73	72	ad3antlr 729	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → ((♯‘𝑢) + 1) = ((𝑁 + 1) + 1))
74	71, 73	eqtr4d 2775	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → (♯‘𝑥) = ((♯‘𝑢) + 1))
75	59, 74	jca 512	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))
76	75	exp31 420	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) → (𝑁 ∈ ℕ → (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
77	58, 76	sylan 580	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) → (𝑁 ∈ ℕ → (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
78	77	com12 32	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 ∈ ℕ → ((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) → (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
79	78	3ad2ant3 1135	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) → (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
80	79	impcom 408	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
81	80	com12 32	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉) → (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
82	81	ancoms 459	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = (𝑁 + 2)) → (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
83	57, 82	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) → (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
84	83	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))) → (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
85	84	com12 32	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → ((𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
86	56, 85	sylbid 239	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
87	86	ralrimiv 3145	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))
88	38, 87	jca 512	. . . . . . . . . . . . . . 15 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
89	88	ex 413	. . . . . . . . . . . . . 14 ⊢ ((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) → ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
90	37, 89	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
91	90	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) → ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1)))))
92	91	imp 407	. . . . . . . . . . 11 ⊢ (((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))))
93		nfcv 2903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣𝑋
94		nfmpo1 7485	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑣(𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ_≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
95	9, 94	nfcxfr 2901	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣𝐻
96		nfcv 2903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣(𝑁 + 2)
97	93, 95, 96	nfov 7435	. . . . . . . . . . . 12 ⊢ Ⅎ𝑣(𝑋𝐻(𝑁 + 2))
98	97	reuccatpfxs1 14693	. . . . . . . . . . 11 ⊢ ((𝑢 ∈ Word 𝑉 ∧ ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = ((♯‘𝑢) + 1))) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (♯‘𝑢))))
99	92, 98	syl 17	. . . . . . . . . 10 ⊢ (((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (♯‘𝑢))))
100	99	imp 407	. . . . . . . . 9 ⊢ ((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (♯‘𝑢)))
101	31	simp3d 1144	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (♯‘𝑢) = (𝑁 + 1))
102	101	eqcomd 2738	. . . . . . . . . . . . 13 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑁 + 1) = (♯‘𝑢))
103	102	ad4antr 730	. . . . . . . . . . . 12 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑁 + 1) = (♯‘𝑢))
104	103	oveq2d 7421	. . . . . . . . . . 11 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑥 prefix (𝑁 + 1)) = (𝑥 prefix (♯‘𝑢)))
105	104	eqeq2d 2743	. . . . . . . . . 10 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑢 = (𝑥 prefix (𝑁 + 1)) ↔ 𝑢 = (𝑥 prefix (♯‘𝑢))))
106	105	reubidva 3392	. . . . . . . . 9 ⊢ ((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) → (∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)) ↔ ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (♯‘𝑢))))
107	100, 106	mpbird 256	. . . . . . . 8 ⊢ ((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))
108	107	exp31 420	. . . . . . 7 ⊢ ((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) → ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))))
109	108	com12 32	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))))
110	30, 109	sylbid 239	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))))
111	110	imp 407	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑢 ∈ (𝑋𝑄𝑁)) → (∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1))))
112	20, 111	mpd 15	. . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑢 ∈ (𝑋𝑄𝑁)) → ∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))
113	112	ralrimiva 3146	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ∀𝑢 ∈ (𝑋𝑄𝑁)∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))
114	10	f1ompt 7107	. 2 ⊢ (𝑅:(𝑋𝐻(𝑁 + 2))–1-1-onto→(𝑋𝑄𝑁) ↔ (∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 prefix (𝑁 + 1)) ∈ (𝑋𝑄𝑁) ∧ ∀𝑢 ∈ (𝑋𝑄𝑁)∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1))))
115	18, 113, 114	sylanbrc 583	1 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝑅:(𝑋𝐻(𝑁 + 2))–1-1-onto→(𝑋𝑄𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃!wreu 3374 {crab 3432 ↦ cmpt 5230 –1-1-onto→wf1o 6539 ‘cfv 6540 (class class class)co 7405 ∈ cmpo 7407 0cc0 11106 1c1 11107 + caddc 11109 − cmin 11440 ℕcn 12208 2c2 12263 ℕ₀cn0 12468 ℤcz 12554 ℤ_≥cuz 12818 ♯chash 14286 Word cword 14460 lastSclsw 14508 ++ cconcat 14516 ⟨“cs1 14541 prefix cpfx 14616 Vtxcvtx 28245 WWalksN cwwlksn 29069 ClWWalksN cclwwlkn 29266 ClWWalksNOncclwwlknon 29329 FriendGraph cfrgr 29500

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 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 theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-xnn0 12541 df-z 12555 df-uz 12819 df-rp 12971 df-fz 13481 df-fzo 13624 df-hash 14287 df-word 14461 df-lsw 14509 df-concat 14517 df-s1 14542 df-substr 14587 df-pfx 14617 df-wwlks 29073 df-wwlksn 29074 df-clwwlk 29224 df-clwwlkn 29267 df-clwwlknon 29330 df-frgr 29501

This theorem is referenced by: numclwwlk2lem3 29622

W3C validator