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 28743

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 2821	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ (𝑋𝐻(𝑁 + 2)) ↔ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))))
2		fveq2 6774	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑅‘𝑦) = (𝑅‘𝑥))
3		oveq1 7282	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑦 prefix (𝑁 + 1)) = (𝑥 prefix (𝑁 + 1)))
4	2, 3	eqeq12d 2754	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → ((𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1)) ↔ (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
5	1, 4	imbi12d 345	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1))) ↔ (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1)))))
6	5	imbi2d 341	. . . . . . 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 28742	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑦 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑦) = (𝑦 prefix (𝑁 + 1))))
12	6, 11	chvarvv 2002	. . . . . 6 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
13	12	3adant1 1129	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1))))
14	13	imp 407	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅‘𝑥) = (𝑥 prefix (𝑁 + 1)))
15	7, 8, 9, 10	numclwlk2lem2f 28741	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝑅:(𝑋𝐻(𝑁 + 2))⟶(𝑋𝑄𝑁))
16	15	ffvelrnda 6961	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅‘𝑥) ∈ (𝑋𝑄𝑁))
17	14, 16	eqeltrrd 2840	. . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑥 prefix (𝑁 + 1)) ∈ (𝑋𝑄𝑁))
18	17	ralrimiva 3103	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ∀𝑥 ∈ (𝑋𝐻(𝑁 + 2))(𝑥 prefix (𝑁 + 1)) ∈ (𝑋𝑄𝑁))
19	7, 8, 9	numclwwlk2lem1 28740	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) → ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))))
20	19	imp 407	. . . 4 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑢 ∈ (𝑋𝑄𝑁)) → ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2)))
21	7, 8	numclwwlkovq 28738	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})
22	21	eleq2d 2824	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ 𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)}))
23	22	3adant1 1129	. . . . . . 7 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ 𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)}))
24		fveq1 6773	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → (𝑤‘0) = (𝑢‘0))
25	24	eqeq1d 2740	. . . . . . . . 9 ⊢ (𝑤 = 𝑢 → ((𝑤‘0) = 𝑋 ↔ (𝑢‘0) = 𝑋))
26		fveq2 6774	. . . . . . . . . 10 ⊢ (𝑤 = 𝑢 → (lastS‘𝑤) = (lastS‘𝑢))
27	26	neeq1d 3003	. . . . . . . . 9 ⊢ (𝑤 = 𝑢 → ((lastS‘𝑤) ≠ 𝑋 ↔ (lastS‘𝑢) ≠ 𝑋))
28	25, 27	anbi12d 631	. . . . . . . 8 ⊢ (𝑤 = 𝑢 → (((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋) ↔ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)))
29	28	elrab 3624	. . . . . . 7 ⊢ (𝑢 ∈ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)} ↔ (𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)))
30	23, 29	bitrdi 287	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑢 ∈ (𝑋𝑄𝑁) ↔ (𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋))))
31		wwlknbp1 28209	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑁 ∈ ℕ₀ ∧ 𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
32		3simpc 1149	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)) → (𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
33	31, 32	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑢 ∈ Word (Vtx‘𝐺) ∧ (♯‘𝑢) = (𝑁 + 1)))
34	7	wrdeqi 14240	. . . . . . . . . . . . . . . . 17 ⊢ Word 𝑉 = Word (Vtx‘𝐺)
35	34	eleq2i 2830	. . . . . . . . . . . . . . . 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 764	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢 ∈ Word 𝑉 ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → 𝑢 ∈ Word 𝑉)
39		nnnn0 12240	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
40		2nn 12046	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 2 ∈ ℕ
41	40	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℕ)
42	41	nnzd 12425	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑁 ∈ ℕ → 2 ∈ ℤ)
43		nn0pzuz 12645	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ ℕ₀ ∧ 2 ∈ ℤ) → (𝑁 + 2) ∈ (ℤ_≥‘2))
44	39, 42, 43	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) ∈ (ℤ_≥‘2))
45	9	numclwwlkovh 28737	. . . . . . . . . . . . . . . . . . . . . . 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 2824	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ 𝑥 ∈ {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))}))
48		fveq1 6773	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = 𝑥 → (𝑤‘0) = (𝑥‘0))
49	48	eqeq1d 2740	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → ((𝑤‘0) = 𝑋 ↔ (𝑥‘0) = 𝑋))
50		fveq1 6773	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑤 = 𝑥 → (𝑤‘((𝑁 + 2) − 2)) = (𝑥‘((𝑁 + 2) − 2)))
51	50, 48	neeq12d 3005	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → ((𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0) ↔ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))
52	49, 51	anbi12d 631	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑥 → (((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0)) ↔ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))))
53	52	elrab 3624	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ {𝑤 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (𝑤‘((𝑁 + 2) − 2)) ≠ (𝑤‘0))} ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0))))
54	47, 53	bitrdi 287	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↔ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) ∧ ((𝑥‘0) = 𝑋 ∧ (𝑥‘((𝑁 + 2) − 2)) ≠ (𝑥‘0)))))
55	54	3adant1 1129	. . . . . . . . . . . . . . . . . . 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 28399	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ((𝑁 + 2) ClWWalksN 𝐺) → (𝑥 ∈ Word 𝑉 ∧ (♯‘𝑥) = (𝑁 + 2)))
58		lencl 14236	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑢 ∈ Word 𝑉 → (♯‘𝑢) ∈ ℕ₀)
59		simprr 770	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → 𝑥 ∈ Word 𝑉)
60		df-2 12036	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ⊢ 2 = (1 + 1)
61	60	a1i 11	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 2 = (1 + 1))
62	61	oveq2d 7291	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) = (𝑁 + (1 + 1)))
63		nncn 11981	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
64		1cnd 10970	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℂ)
65	63, 64, 64	addassd 10997	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (𝑁 ∈ ℕ → ((𝑁 + 1) + 1) = (𝑁 + (1 + 1)))
66	62, 65	eqtr4d 2781	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (𝑁 ∈ ℕ → (𝑁 + 2) = ((𝑁 + 1) + 1))
67	66	adantl 482	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) → (𝑁 + 2) = ((𝑁 + 1) + 1))
68	67	eqeq2d 2749	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 7282	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((♯‘𝑢) = (𝑁 + 1) → ((♯‘𝑢) + 1) = ((𝑁 + 1) + 1))
73	72	ad3antlr 728	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((((♯‘𝑢) ∈ ℕ₀ ∧ (♯‘𝑢) = (𝑁 + 1)) ∧ 𝑁 ∈ ℕ) ∧ ((♯‘𝑥) = (𝑁 + 2) ∧ 𝑥 ∈ Word 𝑉)) → ((♯‘𝑢) + 1) = ((𝑁 + 1) + 1))
74	71, 73	eqtr4d 2781	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 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 1134	. . . . . . . . . . . . . . . . . . . . . . . 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 3102	. . . . . . . . . . . . . . . 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 2907	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣𝑋
94		nfmpo1 7355	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑣(𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ_≥‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
95	9, 94	nfcxfr 2905	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣𝐻
96		nfcv 2907	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑣(𝑁 + 2)
97	93, 95, 96	nfov 7305	. . . . . . . . . . . 12 ⊢ Ⅎ𝑣(𝑋𝐻(𝑁 + 2))
98	97	reuccatpfxs1 14460	. . . . . . . . . . 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 1143	. . . . . . . . . . . . . 14 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (♯‘𝑢) = (𝑁 + 1))
102	101	eqcomd 2744	. . . . . . . . . . . . 13 ⊢ (𝑢 ∈ (𝑁 WWalksN 𝐺) → (𝑁 + 1) = (♯‘𝑢))
103	102	ad4antr 729	. . . . . . . . . . . 12 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑁 + 1) = (♯‘𝑢))
104	103	oveq2d 7291	. . . . . . . . . . 11 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑥 prefix (𝑁 + 1)) = (𝑥 prefix (♯‘𝑢)))
105	104	eqeq2d 2749	. . . . . . . . . 10 ⊢ (((((𝑢 ∈ (𝑁 WWalksN 𝐺) ∧ ((𝑢‘0) = 𝑋 ∧ (lastS‘𝑢) ≠ 𝑋)) ∧ (𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) ∧ ∃!𝑣 ∈ 𝑉 (𝑢 ++ ⟨“𝑣”⟩) ∈ (𝑋𝐻(𝑁 + 2))) ∧ 𝑥 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑢 = (𝑥 prefix (𝑁 + 1)) ↔ 𝑢 = (𝑥 prefix (♯‘𝑢))))
106	105	reubidva 3322	. . . . . . . . 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 3103	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ∀𝑢 ∈ (𝑋𝑄𝑁)∃!𝑥 ∈ (𝑋𝐻(𝑁 + 2))𝑢 = (𝑥 prefix (𝑁 + 1)))
114	10	f1ompt 6985	. 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 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃!wreu 3066 {crab 3068 ↦ cmpt 5157 –1-1-onto→wf1o 6432 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 0cc0 10871 1c1 10872 + caddc 10874 − cmin 11205 ℕcn 11973 2c2 12028 ℕ₀cn0 12233 ℤcz 12319 ℤ_≥cuz 12582 ♯chash 14044 Word cword 14217 lastSclsw 14265 ++ cconcat 14273 ⟨“cs1 14300 prefix cpfx 14383 Vtxcvtx 27366 WWalksN cwwlksn 28191 ClWWalksN cclwwlkn 28388 ClWWalksNOncclwwlknon 28451 FriendGraph cfrgr 28622

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-n0 12234 df-xnn0 12306 df-z 12320 df-uz 12583 df-rp 12731 df-fz 13240 df-fzo 13383 df-hash 14045 df-word 14218 df-lsw 14266 df-concat 14274 df-s1 14301 df-substr 14354 df-pfx 14384 df-wwlks 28195 df-wwlksn 28196 df-clwwlk 28346 df-clwwlkn 28389 df-clwwlknon 28452 df-frgr 28623

This theorem is referenced by: numclwwlk2lem3 28744

W3C validator