clwwlknonclwlknonf1o - Metamath Proof Explorer

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

Theorem clwwlknonclwlknonf1o 30842

Description: 𝐹 is a bijection between the two representations of closed walks of a fixed positive length on a fixed vertex. (Contributed by AV, 26-May-2022.) (Proof shortened by AV, 7-Aug-2022.) (Revised by AV, 1-Nov-2022.)

**Hypotheses**
Ref	Expression
clwwlknonclwlknonf1o.v	⊢ 𝑉 = (Vtx‘𝐺)
clwwlknonclwlknonf1o.w	⊢ 𝑊 = {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)}
clwwlknonclwlknonf1o.f	⊢ 𝐹 = (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))

**Assertion**
Ref	Expression
clwwlknonclwlknonf1o	⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝐹:𝑊–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁))

Distinct variable groups: 𝐺,𝑐,𝑤 𝑁,𝑐,𝑤 𝑉,𝑐 𝑊,𝑐 𝑋,𝑐,𝑤 Allowed substitution hints: 𝐹(𝑤, 𝑐) 𝑉(𝑤) 𝑊(𝑤)

Proof of Theorem clwwlknonclwlknonf1o Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		clwwlknonclwlknonf1o.w	. . 3 ⊢ 𝑊 = {𝑤 ∈ (ClWalks‘𝐺) ∣ ((♯‘(1^st ‘𝑤)) = 𝑁 ∧ ((2^nd ‘𝑤)‘0) = 𝑋)}
2		eqid 2760	. . 3 ⊢ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} = {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁}
3		clwwlknonclwlknonf1o.f	. . 3 ⊢ 𝐹 = (𝑐 ∈ 𝑊 ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))
4		eqid 2760	. . 3 ⊢ (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) = (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))))
5		eqid 2760	. . . . 5 ⊢ (1^st ‘𝑐) = (1^st ‘𝑐)
6		eqid 2760	. . . . 5 ⊢ (2^nd ‘𝑐) = (2^nd ‘𝑐)
7	5, 6, 2, 4	clwlknf1oclwwlkn 30554	. . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ) → (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):{𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁}–1-1-onto→(𝑁 ClWWalksN 𝐺))
8	7	3adant2 1149	. . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ↦ ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))):{𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁}–1-1-onto→(𝑁 ClWWalksN 𝐺))
9		fveq1 6877	. . . . . . 7 ⊢ (𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐))) → (𝑠‘0) = (((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))‘0))
10	9	3ad2ant3 1153	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ∧ 𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) → (𝑠‘0) = (((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))‘0))
11		2fveq3 6883	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑐 → (♯‘(1^st ‘𝑤)) = (♯‘(1^st ‘𝑐)))
12	11	eqeq1d 2762	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑐 → ((♯‘(1^st ‘𝑤)) = 𝑁 ↔ (♯‘(1^st ‘𝑐)) = 𝑁))
13	12	elrab 3645	. . . . . . . . . 10 ⊢ (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ↔ (𝑐 ∈ (ClWalks‘𝐺) ∧ (♯‘(1^st ‘𝑐)) = 𝑁))
14		clwlkwlk 30241	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ (ClWalks‘𝐺) → 𝑐 ∈ (Walks‘𝐺))
15		wlkcpr 30088	. . . . . . . . . . . . 13 ⊢ (𝑐 ∈ (Walks‘𝐺) ↔ (1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐))
16		eqid 2760	. . . . . . . . . . . . . . . . 17 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
17	16	wlkpwrd 30077	. . . . . . . . . . . . . . . 16 ⊢ ((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) → (2^nd ‘𝑐) ∈ Word (Vtx‘𝐺))
18	17	3ad2ant1 1151	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (2^nd ‘𝑐) ∈ Word (Vtx‘𝐺))
19		elnnuz 12927	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ_≥‘1))
20		eluzfz2 13586	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 𝑁 ∈ (1...𝑁))
21	19, 20	sylbi 220	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (1...𝑁))
22		fzelp1 13631	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ (1...𝑁) → 𝑁 ∈ (1...(𝑁 + 1)))
23	21, 22	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ (1...(𝑁 + 1)))
24	23	3ad2ant3 1153	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ (1...(𝑁 + 1)))
25	24	3ad2ant3 1153	. . . . . . . . . . . . . . . . 17 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → 𝑁 ∈ (1...(𝑁 + 1)))
26		id 23	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1^st ‘𝑐)) = 𝑁 → (♯‘(1^st ‘𝑐)) = 𝑁)
27		oveq1 7420	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((♯‘(1^st ‘𝑐)) = 𝑁 → ((♯‘(1^st ‘𝑐)) + 1) = (𝑁 + 1))
28	27	oveq2d 7429	. . . . . . . . . . . . . . . . . . 19 ⊢ ((♯‘(1^st ‘𝑐)) = 𝑁 → (1...((♯‘(1^st ‘𝑐)) + 1)) = (1...(𝑁 + 1)))
29	26, 28	eleq12d 2854	. . . . . . . . . . . . . . . . . 18 ⊢ ((♯‘(1^st ‘𝑐)) = 𝑁 → ((♯‘(1^st ‘𝑐)) ∈ (1...((♯‘(1^st ‘𝑐)) + 1)) ↔ 𝑁 ∈ (1...(𝑁 + 1))))
30	29	3ad2ant2 1152	. . . . . . . . . . . . . . . . 17 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → ((♯‘(1^st ‘𝑐)) ∈ (1...((♯‘(1^st ‘𝑐)) + 1)) ↔ 𝑁 ∈ (1...(𝑁 + 1))))
31	25, 30	mpbird 260	. . . . . . . . . . . . . . . 16 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (♯‘(1^st ‘𝑐)) ∈ (1...((♯‘(1^st ‘𝑐)) + 1)))
32		wlklenvp1 30078	. . . . . . . . . . . . . . . . . . 19 ⊢ ((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) → (♯‘(2^nd ‘𝑐)) = ((♯‘(1^st ‘𝑐)) + 1))
33	32	oveq2d 7429	. . . . . . . . . . . . . . . . . 18 ⊢ ((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) → (1...(♯‘(2^nd ‘𝑐))) = (1...((♯‘(1^st ‘𝑐)) + 1)))
34	33	eleq2d 2846	. . . . . . . . . . . . . . . . 17 ⊢ ((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) → ((♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐))) ↔ (♯‘(1^st ‘𝑐)) ∈ (1...((♯‘(1^st ‘𝑐)) + 1))))
35	34	3ad2ant1 1151	. . . . . . . . . . . . . . . 16 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → ((♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐))) ↔ (♯‘(1^st ‘𝑐)) ∈ (1...((♯‘(1^st ‘𝑐)) + 1))))
36	31, 35	mpbird 260	. . . . . . . . . . . . . . 15 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐))))
37	18, 36	jca 521	. . . . . . . . . . . . . 14 ⊢ (((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) ∧ (♯‘(1^st ‘𝑐)) = 𝑁 ∧ (𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ)) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))))
38	37	3exp 1137	. . . . . . . . . . . . 13 ⊢ ((1^st ‘𝑐)(Walks‘𝐺)(2^nd ‘𝑐) → ((♯‘(1^st ‘𝑐)) = 𝑁 → ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))))))
39	15, 38	sylbi 220	. . . . . . . . . . . 12 ⊢ (𝑐 ∈ (Walks‘𝐺) → ((♯‘(1^st ‘𝑐)) = 𝑁 → ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))))))
40	14, 39	syl 18	. . . . . . . . . . 11 ⊢ (𝑐 ∈ (ClWalks‘𝐺) → ((♯‘(1^st ‘𝑐)) = 𝑁 → ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))))))
41	40	imp 412	. . . . . . . . . 10 ⊢ ((𝑐 ∈ (ClWalks‘𝐺) ∧ (♯‘(1^st ‘𝑐)) = 𝑁) → ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐))))))
42	13, 41	sylbi 220	. . . . . . . . 9 ⊢ (𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} → ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐))))))
43	42	impcom 413	. . . . . . . 8 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁}) → ((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))))
44		pfxfv0 14761	. . . . . . . 8 ⊢ (((2^nd ‘𝑐) ∈ Word (Vtx‘𝐺) ∧ (♯‘(1^st ‘𝑐)) ∈ (1...(♯‘(2^nd ‘𝑐)))) → (((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))‘0) = ((2^nd ‘𝑐)‘0))
45	43, 44	syl 18	. . . . . . 7 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁}) → (((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))‘0) = ((2^nd ‘𝑐)‘0))
46	45	3adant3 1150	. . . . . 6 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ∧ 𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) → (((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))‘0) = ((2^nd ‘𝑐)‘0))
47	10, 46	eqtrd 2795	. . . . 5 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ∧ 𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) → (𝑠‘0) = ((2^nd ‘𝑐)‘0))
48	47	eqeq1d 2762	. . . 4 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ∧ 𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) → ((𝑠‘0) = 𝑋 ↔ ((2^nd ‘𝑐)‘0) = 𝑋))
49		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤((2^nd ‘𝑐)‘0) = 𝑋
50		fveq2 6878	. . . . . . 7 ⊢ (𝑤 = 𝑐 → (2^nd ‘𝑤) = (2^nd ‘𝑐))
51	50	fveq1d 6880	. . . . . 6 ⊢ (𝑤 = 𝑐 → ((2^nd ‘𝑤)‘0) = ((2^nd ‘𝑐)‘0))
52	51	eqeq1d 2762	. . . . 5 ⊢ (𝑤 = 𝑐 → (((2^nd ‘𝑤)‘0) = 𝑋 ↔ ((2^nd ‘𝑐)‘0) = 𝑋))
53	49, 52	sbiev 2345	. . . 4 ⊢ ([𝑐 / 𝑤]((2^nd ‘𝑤)‘0) = 𝑋 ↔ ((2^nd ‘𝑐)‘0) = 𝑋)
54	48, 53	bitr4di 292	. . 3 ⊢ (((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑐 ∈ {𝑤 ∈ (ClWalks‘𝐺) ∣ (♯‘(1^st ‘𝑤)) = 𝑁} ∧ 𝑠 = ((2^nd ‘𝑐) prefix (♯‘(1^st ‘𝑐)))) → ((𝑠‘0) = 𝑋 ↔ [𝑐 / 𝑤]((2^nd ‘𝑤)‘0) = 𝑋))
55	1, 2, 3, 4, 8, 54	f1ossf1o 7122	. 2 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝐹:𝑊–1-1-onto→{𝑠 ∈ (𝑁 ClWWalksN 𝐺) ∣ (𝑠‘0) = 𝑋})
56		clwwlknon 30560	. . 3 ⊢ (𝑋(ClWWalksNOn‘𝐺)𝑁) = {𝑠 ∈ (𝑁 ClWWalksN 𝐺) ∣ (𝑠‘0) = 𝑋}
57		f1oeq3 6807	. . 3 ⊢ ((𝑋(ClWWalksNOn‘𝐺)𝑁) = {𝑠 ∈ (𝑁 ClWWalksN 𝐺) ∣ (𝑠‘0) = 𝑋} → (𝐹:𝑊–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁) ↔ 𝐹:𝑊–1-1-onto→{𝑠 ∈ (𝑁 ClWWalksN 𝐺) ∣ (𝑠‘0) = 𝑋}))
58	56, 57	ax-mp 5	. 2 ⊢ (𝐹:𝑊–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁) ↔ 𝐹:𝑊–1-1-onto→{𝑠 ∈ (𝑁 ClWWalksN 𝐺) ∣ (𝑠‘0) = 𝑋})
59	55, 58	sylibr 237	1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → 𝐹:𝑊–1-1-onto→(𝑋(ClWWalksNOn‘𝐺)𝑁))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 [wsb 2099 ∈ wcel 2145 {crab 3412 class class class wbr 5103 ↦ cmpt 5186 –1-1-onto→wf1o 6532 ‘cfv 6533 (class class class)co 7413 1^st c1st 7984 2^nd c2nd 7985 0cc0 11124 1c1 11125 + caddc 11127 ℕcn 12257 ℤ_≥cuz 12887 ...cfz 13561 ♯chash 14394 Word cword 14578 prefix cpfx 14740 Vtxcvtx 29453 USPGraphcuspgr 29608 Walkscwlks 30056 ClWalkscclwlks 30236 ClWWalksN cclwwlkn 30494 ClWWalksNOncclwwlknon 30557

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-oadd 8459 df-er 8696 df-map 8828 df-pm 8829 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-dju 9906 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-n0 12529 df-xnn0 12602 df-z 12616 df-uz 12888 df-rp 13043 df-fz 13562 df-fzo 13710 df-hash 14395 df-word 14579 df-lsw 14628 df-concat 14636 df-s1 14663 df-substr 14709 df-pfx 14741 df-edg 29505 df-uhgr 29515 df-upgr 29539 df-uspgr 29610 df-wlks 30059 df-clwlks 30237 df-clwwlk 30452 df-clwwlkn 30495 df-clwwlknon 30558

This theorem is used by: clwwlknonclwlknonen 30843 dlwwlknondlwlknonf1o 30845

W3C validator