splval2 - Metamath Proof Explorer

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

Theorem splval2 14706

Description: Value of a splice, assuming the input word 𝑆 has already been decomposed into its pieces. (Contributed by Mario Carneiro, 1-Oct-2015.) (Proof shortened by AV, 15-Oct-2022.)

**Hypotheses**
Ref	Expression
splval2.a	⊢ (𝜑 → 𝐴 ∈ Word 𝑋)
splval2.b	⊢ (𝜑 → 𝐵 ∈ Word 𝑋)
splval2.c	⊢ (𝜑 → 𝐶 ∈ Word 𝑋)
splval2.r	⊢ (𝜑 → 𝑅 ∈ Word 𝑋)
splval2.s	⊢ (𝜑 → 𝑆 = ((𝐴 ++ 𝐵) ++ 𝐶))
splval2.f	⊢ (𝜑 → 𝐹 = (♯‘𝐴))
splval2.t	⊢ (𝜑 → 𝑇 = (𝐹 + (♯‘𝐵)))

**Assertion**
Ref	Expression
splval2	⊢ (𝜑 → (𝑆 splice ⟨𝐹, 𝑇, 𝑅⟩) = ((𝐴 ++ 𝑅) ++ 𝐶))

**Proof of Theorem splval2**
Step	Hyp	Ref	Expression
1		splval2.s	. . . 4 ⊢ (𝜑 → 𝑆 = ((𝐴 ++ 𝐵) ++ 𝐶))
2		splval2.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Word 𝑋)
3		splval2.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ Word 𝑋)
4		ccatcl 14523	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑋 ∧ 𝐵 ∈ Word 𝑋) → (𝐴 ++ 𝐵) ∈ Word 𝑋)
5	2, 3, 4	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝐴 ++ 𝐵) ∈ Word 𝑋)
6		splval2.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Word 𝑋)
7		ccatcl 14523	. . . . 5 ⊢ (((𝐴 ++ 𝐵) ∈ Word 𝑋 ∧ 𝐶 ∈ Word 𝑋) → ((𝐴 ++ 𝐵) ++ 𝐶) ∈ Word 𝑋)
8	5, 6, 7	syl2anc 584	. . . 4 ⊢ (𝜑 → ((𝐴 ++ 𝐵) ++ 𝐶) ∈ Word 𝑋)
9	1, 8	eqeltrd 2833	. . 3 ⊢ (𝜑 → 𝑆 ∈ Word 𝑋)
10		splval2.f	. . . 4 ⊢ (𝜑 → 𝐹 = (♯‘𝐴))
11		lencl 14482	. . . . 5 ⊢ (𝐴 ∈ Word 𝑋 → (♯‘𝐴) ∈ ℕ₀)
12	2, 11	syl 17	. . . 4 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ₀)
13	10, 12	eqeltrd 2833	. . 3 ⊢ (𝜑 → 𝐹 ∈ ℕ₀)
14		splval2.t	. . . 4 ⊢ (𝜑 → 𝑇 = (𝐹 + (♯‘𝐵)))
15		lencl 14482	. . . . . 6 ⊢ (𝐵 ∈ Word 𝑋 → (♯‘𝐵) ∈ ℕ₀)
16	3, 15	syl 17	. . . . 5 ⊢ (𝜑 → (♯‘𝐵) ∈ ℕ₀)
17	13, 16	nn0addcld 12535	. . . 4 ⊢ (𝜑 → (𝐹 + (♯‘𝐵)) ∈ ℕ₀)
18	14, 17	eqeltrd 2833	. . 3 ⊢ (𝜑 → 𝑇 ∈ ℕ₀)
19		splval2.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Word 𝑋)
20		splval 14700	. . 3 ⊢ ((𝑆 ∈ Word 𝑋 ∧ (𝐹 ∈ ℕ₀ ∧ 𝑇 ∈ ℕ₀ ∧ 𝑅 ∈ Word 𝑋)) → (𝑆 splice ⟨𝐹, 𝑇, 𝑅⟩) = (((𝑆 prefix 𝐹) ++ 𝑅) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)))
21	9, 13, 18, 19, 20	syl13anc 1372	. 2 ⊢ (𝜑 → (𝑆 splice ⟨𝐹, 𝑇, 𝑅⟩) = (((𝑆 prefix 𝐹) ++ 𝑅) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)))
22		nn0uz 12863	. . . . . . . . . 10 ⊢ ℕ₀ = (ℤ_≥‘0)
23	13, 22	eleqtrdi 2843	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (ℤ_≥‘0))
24	13	nn0zd 12583	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 ∈ ℤ)
25	24	uzidd 12837	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ (ℤ_≥‘𝐹))
26		uzaddcl 12887	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (ℤ_≥‘𝐹) ∧ (♯‘𝐵) ∈ ℕ₀) → (𝐹 + (♯‘𝐵)) ∈ (ℤ_≥‘𝐹))
27	25, 16, 26	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 + (♯‘𝐵)) ∈ (ℤ_≥‘𝐹))
28	14, 27	eqeltrd 2833	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ (ℤ_≥‘𝐹))
29		elfzuzb 13494	. . . . . . . . 9 ⊢ (𝐹 ∈ (0...𝑇) ↔ (𝐹 ∈ (ℤ_≥‘0) ∧ 𝑇 ∈ (ℤ_≥‘𝐹)))
30	23, 28, 29	sylanbrc 583	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ (0...𝑇))
31	18, 22	eleqtrdi 2843	. . . . . . . . 9 ⊢ (𝜑 → 𝑇 ∈ (ℤ_≥‘0))
32		ccatlen 14524	. . . . . . . . . . . 12 ⊢ (((𝐴 ++ 𝐵) ∈ Word 𝑋 ∧ 𝐶 ∈ Word 𝑋) → (♯‘((𝐴 ++ 𝐵) ++ 𝐶)) = ((♯‘(𝐴 ++ 𝐵)) + (♯‘𝐶)))
33	5, 6, 32	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘((𝐴 ++ 𝐵) ++ 𝐶)) = ((♯‘(𝐴 ++ 𝐵)) + (♯‘𝐶)))
34	1	fveq2d 6895	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝑆) = (♯‘((𝐴 ++ 𝐵) ++ 𝐶)))
35	10	oveq1d 7423	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐹 + (♯‘𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
36		ccatlen 14524	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑋 ∧ 𝐵 ∈ Word 𝑋) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
37	2, 3, 36	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
38	35, 14, 37	3eqtr4d 2782	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 = (♯‘(𝐴 ++ 𝐵)))
39	38	oveq1d 7423	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 + (♯‘𝐶)) = ((♯‘(𝐴 ++ 𝐵)) + (♯‘𝐶)))
40	33, 34, 39	3eqtr4d 2782	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝑆) = (𝑇 + (♯‘𝐶)))
41	18	nn0zd 12583	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑇 ∈ ℤ)
42	41	uzidd 12837	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇 ∈ (ℤ_≥‘𝑇))
43		lencl 14482	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ Word 𝑋 → (♯‘𝐶) ∈ ℕ₀)
44	6, 43	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝐶) ∈ ℕ₀)
45		uzaddcl 12887	. . . . . . . . . . 11 ⊢ ((𝑇 ∈ (ℤ_≥‘𝑇) ∧ (♯‘𝐶) ∈ ℕ₀) → (𝑇 + (♯‘𝐶)) ∈ (ℤ_≥‘𝑇))
46	42, 44, 45	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (𝑇 + (♯‘𝐶)) ∈ (ℤ_≥‘𝑇))
47	40, 46	eqeltrd 2833	. . . . . . . . 9 ⊢ (𝜑 → (♯‘𝑆) ∈ (ℤ_≥‘𝑇))
48		elfzuzb 13494	. . . . . . . . 9 ⊢ (𝑇 ∈ (0...(♯‘𝑆)) ↔ (𝑇 ∈ (ℤ_≥‘0) ∧ (♯‘𝑆) ∈ (ℤ_≥‘𝑇)))
49	31, 47, 48	sylanbrc 583	. . . . . . . 8 ⊢ (𝜑 → 𝑇 ∈ (0...(♯‘𝑆)))
50		ccatpfx 14650	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝑋 ∧ 𝐹 ∈ (0...𝑇) ∧ 𝑇 ∈ (0...(♯‘𝑆))) → ((𝑆 prefix 𝐹) ++ (𝑆 substr ⟨𝐹, 𝑇⟩)) = (𝑆 prefix 𝑇))
51	9, 30, 49, 50	syl3anc 1371	. . . . . . 7 ⊢ (𝜑 → ((𝑆 prefix 𝐹) ++ (𝑆 substr ⟨𝐹, 𝑇⟩)) = (𝑆 prefix 𝑇))
52		lencl 14482	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ Word 𝑋 → (♯‘𝑆) ∈ ℕ₀)
53	9, 52	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (♯‘𝑆) ∈ ℕ₀)
54	53, 22	eleqtrdi 2843	. . . . . . . . . . . 12 ⊢ (𝜑 → (♯‘𝑆) ∈ (ℤ_≥‘0))
55		eluzfz2 13508	. . . . . . . . . . . 12 ⊢ ((♯‘𝑆) ∈ (ℤ_≥‘0) → (♯‘𝑆) ∈ (0...(♯‘𝑆)))
56	54, 55	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝑆) ∈ (0...(♯‘𝑆)))
57		ccatpfx 14650	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝑋 ∧ 𝑇 ∈ (0...(♯‘𝑆)) ∧ (♯‘𝑆) ∈ (0...(♯‘𝑆))) → ((𝑆 prefix 𝑇) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = (𝑆 prefix (♯‘𝑆)))
58	9, 49, 56, 57	syl3anc 1371	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑆 prefix 𝑇) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = (𝑆 prefix (♯‘𝑆)))
59		pfxid 14633	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝑋 → (𝑆 prefix (♯‘𝑆)) = 𝑆)
60	9, 59	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 prefix (♯‘𝑆)) = 𝑆)
61	58, 60, 1	3eqtrd 2776	. . . . . . . . 9 ⊢ (𝜑 → ((𝑆 prefix 𝑇) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = ((𝐴 ++ 𝐵) ++ 𝐶))
62		pfxcl 14626	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝑋 → (𝑆 prefix 𝑇) ∈ Word 𝑋)
63	9, 62	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 prefix 𝑇) ∈ Word 𝑋)
64		swrdcl 14594	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝑋 → (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) ∈ Word 𝑋)
65	9, 64	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) ∈ Word 𝑋)
66		pfxlen 14632	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝑋 ∧ 𝑇 ∈ (0...(♯‘𝑆))) → (♯‘(𝑆 prefix 𝑇)) = 𝑇)
67	9, 49, 66	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘(𝑆 prefix 𝑇)) = 𝑇)
68	67, 38	eqtrd 2772	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘(𝑆 prefix 𝑇)) = (♯‘(𝐴 ++ 𝐵)))
69		ccatopth 14665	. . . . . . . . . 10 ⊢ ((((𝑆 prefix 𝑇) ∈ Word 𝑋 ∧ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) ∈ Word 𝑋) ∧ ((𝐴 ++ 𝐵) ∈ Word 𝑋 ∧ 𝐶 ∈ Word 𝑋) ∧ (♯‘(𝑆 prefix 𝑇)) = (♯‘(𝐴 ++ 𝐵))) → (((𝑆 prefix 𝑇) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = ((𝐴 ++ 𝐵) ++ 𝐶) ↔ ((𝑆 prefix 𝑇) = (𝐴 ++ 𝐵) ∧ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) = 𝐶)))
70	63, 65, 5, 6, 68, 69	syl221anc 1381	. . . . . . . . 9 ⊢ (𝜑 → (((𝑆 prefix 𝑇) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = ((𝐴 ++ 𝐵) ++ 𝐶) ↔ ((𝑆 prefix 𝑇) = (𝐴 ++ 𝐵) ∧ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) = 𝐶)))
71	61, 70	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → ((𝑆 prefix 𝑇) = (𝐴 ++ 𝐵) ∧ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) = 𝐶))
72	71	simpld 495	. . . . . . 7 ⊢ (𝜑 → (𝑆 prefix 𝑇) = (𝐴 ++ 𝐵))
73	51, 72	eqtrd 2772	. . . . . 6 ⊢ (𝜑 → ((𝑆 prefix 𝐹) ++ (𝑆 substr ⟨𝐹, 𝑇⟩)) = (𝐴 ++ 𝐵))
74		pfxcl 14626	. . . . . . . 8 ⊢ (𝑆 ∈ Word 𝑋 → (𝑆 prefix 𝐹) ∈ Word 𝑋)
75	9, 74	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑆 prefix 𝐹) ∈ Word 𝑋)
76		swrdcl 14594	. . . . . . . 8 ⊢ (𝑆 ∈ Word 𝑋 → (𝑆 substr ⟨𝐹, 𝑇⟩) ∈ Word 𝑋)
77	9, 76	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑆 substr ⟨𝐹, 𝑇⟩) ∈ Word 𝑋)
78		uztrn 12839	. . . . . . . . . . 11 ⊢ (((♯‘𝑆) ∈ (ℤ_≥‘𝑇) ∧ 𝑇 ∈ (ℤ_≥‘𝐹)) → (♯‘𝑆) ∈ (ℤ_≥‘𝐹))
79	47, 28, 78	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝑆) ∈ (ℤ_≥‘𝐹))
80		elfzuzb 13494	. . . . . . . . . 10 ⊢ (𝐹 ∈ (0...(♯‘𝑆)) ↔ (𝐹 ∈ (ℤ_≥‘0) ∧ (♯‘𝑆) ∈ (ℤ_≥‘𝐹)))
81	23, 79, 80	sylanbrc 583	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (0...(♯‘𝑆)))
82		pfxlen 14632	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝑋 ∧ 𝐹 ∈ (0...(♯‘𝑆))) → (♯‘(𝑆 prefix 𝐹)) = 𝐹)
83	9, 81, 82	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (♯‘(𝑆 prefix 𝐹)) = 𝐹)
84	83, 10	eqtrd 2772	. . . . . . 7 ⊢ (𝜑 → (♯‘(𝑆 prefix 𝐹)) = (♯‘𝐴))
85		ccatopth 14665	. . . . . . 7 ⊢ ((((𝑆 prefix 𝐹) ∈ Word 𝑋 ∧ (𝑆 substr ⟨𝐹, 𝑇⟩) ∈ Word 𝑋) ∧ (𝐴 ∈ Word 𝑋 ∧ 𝐵 ∈ Word 𝑋) ∧ (♯‘(𝑆 prefix 𝐹)) = (♯‘𝐴)) → (((𝑆 prefix 𝐹) ++ (𝑆 substr ⟨𝐹, 𝑇⟩)) = (𝐴 ++ 𝐵) ↔ ((𝑆 prefix 𝐹) = 𝐴 ∧ (𝑆 substr ⟨𝐹, 𝑇⟩) = 𝐵)))
86	75, 77, 2, 3, 84, 85	syl221anc 1381	. . . . . 6 ⊢ (𝜑 → (((𝑆 prefix 𝐹) ++ (𝑆 substr ⟨𝐹, 𝑇⟩)) = (𝐴 ++ 𝐵) ↔ ((𝑆 prefix 𝐹) = 𝐴 ∧ (𝑆 substr ⟨𝐹, 𝑇⟩) = 𝐵)))
87	73, 86	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝑆 prefix 𝐹) = 𝐴 ∧ (𝑆 substr ⟨𝐹, 𝑇⟩) = 𝐵))
88	87	simpld 495	. . . 4 ⊢ (𝜑 → (𝑆 prefix 𝐹) = 𝐴)
89	88	oveq1d 7423	. . 3 ⊢ (𝜑 → ((𝑆 prefix 𝐹) ++ 𝑅) = (𝐴 ++ 𝑅))
90	71	simprd 496	. . 3 ⊢ (𝜑 → (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩) = 𝐶)
91	89, 90	oveq12d 7426	. 2 ⊢ (𝜑 → (((𝑆 prefix 𝐹) ++ 𝑅) ++ (𝑆 substr ⟨𝑇, (♯‘𝑆)⟩)) = ((𝐴 ++ 𝑅) ++ 𝐶))
92	21, 91	eqtrd 2772	1 ⊢ (𝜑 → (𝑆 splice ⟨𝐹, 𝑇, 𝑅⟩) = ((𝐴 ++ 𝑅) ++ 𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ⟨cop 4634 ⟨cotp 4636 ‘cfv 6543 (class class class)co 7408 0cc0 11109 + caddc 11112 ℕ₀cn0 12471 ℤ_≥cuz 12821 ...cfz 13483 ♯chash 14289 Word cword 14463 ++ cconcat 14519 substr csubstr 14589 prefix cpfx 14619 splice csplice 14698

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 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

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-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-ot 4637 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-card 9933 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-n0 12472 df-z 12558 df-uz 12822 df-fz 13484 df-fzo 13627 df-hash 14290 df-word 14464 df-concat 14520 df-substr 14590 df-pfx 14620 df-splice 14699

This theorem is referenced by: efginvrel2 19594 efgredleme 19610 efgcpbllemb 19622 frgpnabllem1 19740

W3C validator