sticksstones7 - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sticksstones7		Structured version Visualization version GIF version

Theorem sticksstones7 41710

Description: Closure property of sticks and stones function. (Contributed by metakunt, 1-Oct-2024.)

**Hypotheses**
Ref	Expression
sticksstones7.1	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
sticksstones7.2	⊢ (𝜑 → 𝐾 ∈ ℕ₀)
sticksstones7.3	⊢ (𝜑 → 𝐺:(1...(𝐾 + 1))⟶ℕ₀)
sticksstones7.4	⊢ (𝜑 → 𝑋 ∈ (1...𝐾))
sticksstones7.5	⊢ 𝐹 = (𝑥 ∈ (1...𝐾) ↦ (𝑥 + Σ𝑖 ∈ (1...𝑥)(𝐺‘𝑖)))
sticksstones7.6	⊢ (𝜑 → Σ𝑖 ∈ (1...(𝐾 + 1))(𝐺‘𝑖) = 𝑁)

**Assertion**
Ref	Expression
sticksstones7	⊢ (𝜑 → (𝐹‘𝑋) ∈ (1...(𝑁 + 𝐾)))

Distinct variable groups: 𝑥,𝐺 𝑖,𝐾,𝑥 𝑖,𝑋,𝑥 𝜑,𝑖,𝑥 Allowed substitution hints: 𝐹(𝑥,𝑖) 𝐺(𝑖) 𝑁(𝑥,𝑖)

**Proof of Theorem sticksstones7**
Step	Hyp	Ref	Expression
1		sticksstones7.5	. . . 4 ⊢ 𝐹 = (𝑥 ∈ (1...𝐾) ↦ (𝑥 + Σ𝑖 ∈ (1...𝑥)(𝐺‘𝑖)))
2	1	a1i 11	. . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (1...𝐾) ↦ (𝑥 + Σ𝑖 ∈ (1...𝑥)(𝐺‘𝑖))))
3		simpr 483	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
4	3	oveq2d 7433	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (1...𝑥) = (1...𝑋))
5	4	sumeq1d 15680	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → Σ𝑖 ∈ (1...𝑥)(𝐺‘𝑖) = Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖))
6	3, 5	oveq12d 7435	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥 + Σ𝑖 ∈ (1...𝑥)(𝐺‘𝑖)) = (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)))
7		sticksstones7.4	. . 3 ⊢ (𝜑 → 𝑋 ∈ (1...𝐾))
8		elfznn 13562	. . . . . 6 ⊢ (𝑋 ∈ (1...𝐾) → 𝑋 ∈ ℕ)
9	7, 8	syl 17	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ ℕ)
10	9	nnnn0d 12562	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ℕ₀)
11		fzfid 13971	. . . . 5 ⊢ (𝜑 → (1...𝑋) ∈ Fin)
12		1zzd 12623	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 1 ∈ ℤ)
13		sticksstones7.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
14	13	nn0zd 12614	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ ℤ)
15	14	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝐾 ∈ ℤ)
16	15	peano2zd 12699	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → (𝐾 + 1) ∈ ℤ)
17		elfzelz 13533	. . . . . . . 8 ⊢ (𝑖 ∈ (1...𝑋) → 𝑖 ∈ ℤ)
18	17	adantl 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑖 ∈ ℤ)
19		elfzle1 13536	. . . . . . . 8 ⊢ (𝑖 ∈ (1...𝑋) → 1 ≤ 𝑖)
20	19	adantl 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 1 ≤ 𝑖)
21	18	zred 12696	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑖 ∈ ℝ)
22	9	nnred 12257	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ ℝ)
23	22	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑋 ∈ ℝ)
24	16	zred 12696	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → (𝐾 + 1) ∈ ℝ)
25		elfzle2 13537	. . . . . . . . 9 ⊢ (𝑖 ∈ (1...𝑋) → 𝑖 ≤ 𝑋)
26	25	adantl 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑖 ≤ 𝑋)
27	13	nn0red 12563	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ ℝ)
28		1red 11245	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ ℝ)
29	27, 28	readdcld 11273	. . . . . . . . . 10 ⊢ (𝜑 → (𝐾 + 1) ∈ ℝ)
30		elfzle2 13537	. . . . . . . . . . 11 ⊢ (𝑋 ∈ (1...𝐾) → 𝑋 ≤ 𝐾)
31	7, 30	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ≤ 𝐾)
32	27	lep1d 12175	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ≤ (𝐾 + 1))
33	22, 27, 29, 31, 32	letrd 11401	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≤ (𝐾 + 1))
34	33	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑋 ≤ (𝐾 + 1))
35	21, 23, 24, 26, 34	letrd 11401	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑖 ≤ (𝐾 + 1))
36	12, 16, 18, 20, 35	elfzd 13524	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝑖 ∈ (1...(𝐾 + 1)))
37		sticksstones7.3	. . . . . . . 8 ⊢ (𝜑 → 𝐺:(1...(𝐾 + 1))⟶ℕ₀)
38	37	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → 𝐺:(1...(𝐾 + 1))⟶ℕ₀)
39	38	ffvelcdmda 7091	. . . . . 6 ⊢ (((𝜑 ∧ 𝑖 ∈ (1...𝑋)) ∧ 𝑖 ∈ (1...(𝐾 + 1))) → (𝐺‘𝑖) ∈ ℕ₀)
40	36, 39	mpdan 685	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑋)) → (𝐺‘𝑖) ∈ ℕ₀)
41	11, 40	fsumnn0cl 15715	. . . 4 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ∈ ℕ₀)
42	10, 41	nn0addcld 12566	. . 3 ⊢ (𝜑 → (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)) ∈ ℕ₀)
43	2, 6, 7, 42	fvmptd 7009	. 2 ⊢ (𝜑 → (𝐹‘𝑋) = (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)))
44		1zzd 12623	. . 3 ⊢ (𝜑 → 1 ∈ ℤ)
45		sticksstones7.1	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
46	45	nn0zd 12614	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
47	46, 14	zaddcld 12700	. . 3 ⊢ (𝜑 → (𝑁 + 𝐾) ∈ ℤ)
48	42	nn0zd 12614	. . 3 ⊢ (𝜑 → (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)) ∈ ℤ)
49		eqid 2725	. . . . . 6 ⊢ 1 = 1
50		1p0e1 12366	. . . . . 6 ⊢ (1 + 0) = 1
51	49, 50	eqtr4i 2756	. . . . 5 ⊢ 1 = (1 + 0)
52	51	a1i 11	. . . 4 ⊢ (𝜑 → 1 = (1 + 0))
53		0red 11247	. . . . 5 ⊢ (𝜑 → 0 ∈ ℝ)
54	41	nn0red 12563	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ∈ ℝ)
55	9	nnge1d 12290	. . . . 5 ⊢ (𝜑 → 1 ≤ 𝑋)
56	41	nn0ge0d 12565	. . . . 5 ⊢ (𝜑 → 0 ≤ Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖))
57	28, 53, 22, 54, 55, 56	le2addd 11863	. . . 4 ⊢ (𝜑 → (1 + 0) ≤ (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)))
58	52, 57	eqbrtrd 5170	. . 3 ⊢ (𝜑 → 1 ≤ (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)))
59	45	nn0red 12563	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℝ)
60		fzfid 13971	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑋 + 1)...(𝐾 + 1)) ∈ Fin)
61	44	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 1 ∈ ℤ)
62	14	peano2zd 12699	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐾 + 1) ∈ ℤ)
63	62	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → (𝐾 + 1) ∈ ℤ)
64		elfzelz 13533	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1)) → 𝑖 ∈ ℤ)
65	64	adantl 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑖 ∈ ℤ)
66	28	adantr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 1 ∈ ℝ)
67	22	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑋 ∈ ℝ)
68	67, 66	readdcld 11273	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → (𝑋 + 1) ∈ ℝ)
69	65	zred 12696	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑖 ∈ ℝ)
70	55	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 1 ≤ 𝑋)
71	67	lep1d 12175	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑋 ≤ (𝑋 + 1))
72	66, 67, 68, 70, 71	letrd 11401	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 1 ≤ (𝑋 + 1))
73		elfzle1 13536	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1)) → (𝑋 + 1) ≤ 𝑖)
74	73	adantl 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → (𝑋 + 1) ≤ 𝑖)
75	66, 68, 69, 72, 74	letrd 11401	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 1 ≤ 𝑖)
76		elfzle2 13537	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1)) → 𝑖 ≤ (𝐾 + 1))
77	76	adantl 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑖 ≤ (𝐾 + 1))
78	61, 63, 65, 75, 77	elfzd 13524	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → 𝑖 ∈ (1...(𝐾 + 1)))
79	37	ffvelcdmda 7091	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...(𝐾 + 1))) → (𝐺‘𝑖) ∈ ℕ₀)
80	79	adantlr 713	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) ∧ 𝑖 ∈ (1...(𝐾 + 1))) → (𝐺‘𝑖) ∈ ℕ₀)
81	78, 80	mpdan 685	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))) → (𝐺‘𝑖) ∈ ℕ₀)
82	60, 81	fsumnn0cl 15715	. . . . . . . . 9 ⊢ (𝜑 → Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖) ∈ ℕ₀)
83	82	nn0ge0d 12565	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖))
84	82	nn0red 12563	. . . . . . . . 9 ⊢ (𝜑 → Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖) ∈ ℝ)
85	54, 84	addge01d 11832	. . . . . . . 8 ⊢ (𝜑 → (0 ≤ Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖) ↔ Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ≤ (Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) + Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖))))
86	83, 85	mpbid 231	. . . . . . 7 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ≤ (Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) + Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖)))
87	22	ltp1d 12174	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 < (𝑋 + 1))
88		fzdisj 13560	. . . . . . . . 9 ⊢ (𝑋 < (𝑋 + 1) → ((1...𝑋) ∩ ((𝑋 + 1)...(𝐾 + 1))) = ∅)
89	87, 88	syl 17	. . . . . . . 8 ⊢ (𝜑 → ((1...𝑋) ∩ ((𝑋 + 1)...(𝐾 + 1))) = ∅)
90	10	nn0zd 12614	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ℤ)
91	44, 62, 90, 55, 33	elfzd 13524	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ (1...(𝐾 + 1)))
92		fzsplit 13559	. . . . . . . . 9 ⊢ (𝑋 ∈ (1...(𝐾 + 1)) → (1...(𝐾 + 1)) = ((1...𝑋) ∪ ((𝑋 + 1)...(𝐾 + 1))))
93	91, 92	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1...(𝐾 + 1)) = ((1...𝑋) ∪ ((𝑋 + 1)...(𝐾 + 1))))
94		fzfid 13971	. . . . . . . 8 ⊢ (𝜑 → (1...(𝐾 + 1)) ∈ Fin)
95		nn0cn 12512	. . . . . . . . 9 ⊢ ((𝐺‘𝑖) ∈ ℕ₀ → (𝐺‘𝑖) ∈ ℂ)
96	79, 95	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...(𝐾 + 1))) → (𝐺‘𝑖) ∈ ℂ)
97	89, 93, 94, 96	fsumsplit 15720	. . . . . . 7 ⊢ (𝜑 → Σ𝑖 ∈ (1...(𝐾 + 1))(𝐺‘𝑖) = (Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) + Σ𝑖 ∈ ((𝑋 + 1)...(𝐾 + 1))(𝐺‘𝑖)))
98	86, 97	breqtrrd 5176	. . . . . 6 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ≤ Σ𝑖 ∈ (1...(𝐾 + 1))(𝐺‘𝑖))
99		sticksstones7.6	. . . . . . 7 ⊢ (𝜑 → Σ𝑖 ∈ (1...(𝐾 + 1))(𝐺‘𝑖) = 𝑁)
100	99	eqcomd 2731	. . . . . 6 ⊢ (𝜑 → 𝑁 = Σ𝑖 ∈ (1...(𝐾 + 1))(𝐺‘𝑖))
101	98, 100	breqtrrd 5176	. . . . 5 ⊢ (𝜑 → Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖) ≤ 𝑁)
102	22, 54, 27, 59, 31, 101	le2addd 11863	. . . 4 ⊢ (𝜑 → (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)) ≤ (𝐾 + 𝑁))
103	13	nn0cnd 12564	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℂ)
104	45	nn0cnd 12564	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℂ)
105	103, 104	addcomd 11446	. . . 4 ⊢ (𝜑 → (𝐾 + 𝑁) = (𝑁 + 𝐾))
106	102, 105	breqtrd 5174	. . 3 ⊢ (𝜑 → (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)) ≤ (𝑁 + 𝐾))
107	44, 47, 48, 58, 106	elfzd 13524	. 2 ⊢ (𝜑 → (𝑋 + Σ𝑖 ∈ (1...𝑋)(𝐺‘𝑖)) ∈ (1...(𝑁 + 𝐾)))
108	43, 107	eqeltrd 2825	1 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (1...(𝑁 + 𝐾)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∪ cun 3943 ∩ cin 3944 ∅c0 4323 class class class wbr 5148 ↦ cmpt 5231 ⟶wf 6543 ‘cfv 6547 (class class class)co 7417 ℂcc 11136 ℝcr 11137 0cc0 11138 1c1 11139 + caddc 11141 < clt 11278 ≤ cle 11279 ℕcn 12242 ℕ₀cn0 12502 ℤcz 12588 ...cfz 13516 Σcsu 15665

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-inf2 9664 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-pre-sup 11216

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-oi 9533 df-card 9962 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-3 12306 df-n0 12503 df-z 12589 df-uz 12853 df-rp 13007 df-fz 13517 df-fzo 13660 df-seq 14000 df-exp 14060 df-hash 14323 df-cj 15079 df-re 15080 df-im 15081 df-sqrt 15215 df-abs 15216 df-clim 15465 df-sum 15666

This theorem is referenced by: sticksstones8 41711

W3C validator

	
		OSZAR »