etransclem15 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > etransclem15		Structured version Visualization version GIF version

Theorem etransclem15 46607

Description: Value of the term 𝑇, when 𝐽 = 0 and (𝐶‘0) = 𝑃 − 1 (Contributed by Glauco Siliprandi, 5-Apr-2020.)

**Hypotheses**
Ref	Expression
etransclem15.p	⊢ (𝜑 → 𝑃 ∈ ℕ)
etransclem15.m	⊢ (𝜑 → 𝑀 ∈ ℕ₀)
etransclem15.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
etransclem15.c	⊢ (𝜑 → 𝐶:(0...𝑀)⟶(0...𝑁))
etransclem15.t	⊢ 𝑇 = (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))))
etransclem15.j	⊢ (𝜑 → 𝐽 = 0)
etransclem15.cpm1	⊢ (𝜑 → (𝐶‘0) ≠ (𝑃 − 1))

**Assertion**
Ref	Expression
etransclem15	⊢ (𝜑 → 𝑇 = 0)

Distinct variable groups: 𝑗,𝑀 𝜑,𝑗 Allowed substitution hints: 𝐶(𝑗) 𝑃(𝑗) 𝑇(𝑗) 𝐽(𝑗) 𝑁(𝑗)

**Proof of Theorem etransclem15**
Step	Hyp	Ref	Expression
1		etransclem15.t	. . 3 ⊢ 𝑇 = (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))))
2	1	a1i 11	. 2 ⊢ (𝜑 → 𝑇 = (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗))))))))
3		iftrue 4487	. . . . . . 7 ⊢ ((𝑃 − 1) < (𝐶‘0) → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = 0)
4	3	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑃 − 1) < (𝐶‘0)) → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = 0)
5		iffalse 4490	. . . . . . . 8 ⊢ (¬ (𝑃 − 1) < (𝐶‘0) → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0)))))
6	5	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0)))))
7		etransclem15.j	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 = 0)
8	7	oveq1d 7383	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽↑((𝑃 − 1) − (𝐶‘0))) = (0↑((𝑃 − 1) − (𝐶‘0))))
9	8	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝐽↑((𝑃 − 1) − (𝐶‘0))) = (0↑((𝑃 − 1) − (𝐶‘0))))
10		etransclem15.p	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 ∈ ℕ)
11	10	nnzd 12526	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑃 ∈ ℤ)
12		1zzd 12534	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 1 ∈ ℤ)
13	11, 12	zsubcld 12613	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃 − 1) ∈ ℤ)
14		etransclem15.c	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐶:(0...𝑀)⟶(0...𝑁))
15		etransclem15.m	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
16		nn0uz 12801	. . . . . . . . . . . . . . . . 17 ⊢ ℕ₀ = (ℤ_≥‘0)
17	15, 16	eleqtrdi 2847	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘0))
18		eluzfz1 13459	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ (ℤ_≥‘0) → 0 ∈ (0...𝑀))
19	17, 18	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 ∈ (0...𝑀))
20	14, 19	ffvelcdmd 7039	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐶‘0) ∈ (0...𝑁))
21	20	elfzelzd 13453	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐶‘0) ∈ ℤ)
22	13, 21	zsubcld 12613	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑃 − 1) − (𝐶‘0)) ∈ ℤ)
23	22	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ((𝑃 − 1) − (𝐶‘0)) ∈ ℤ)
24	21	zred 12608	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐶‘0) ∈ ℝ)
25	24	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝐶‘0) ∈ ℝ)
26	13	zred 12608	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑃 − 1) ∈ ℝ)
27	26	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝑃 − 1) ∈ ℝ)
28		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ¬ (𝑃 − 1) < (𝐶‘0))
29	25, 27, 28	nltled 11295	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝐶‘0) ≤ (𝑃 − 1))
30		etransclem15.cpm1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐶‘0) ≠ (𝑃 − 1))
31	30	necomd 2988	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑃 − 1) ≠ (𝐶‘0))
32	31	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝑃 − 1) ≠ (𝐶‘0))
33	25, 27, 29, 32	leneltd 11299	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝐶‘0) < (𝑃 − 1))
34	25, 27	posdifd 11736	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ((𝐶‘0) < (𝑃 − 1) ↔ 0 < ((𝑃 − 1) − (𝐶‘0))))
35	33, 34	mpbid 232	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → 0 < ((𝑃 − 1) − (𝐶‘0)))
36		elnnz 12510	. . . . . . . . . . 11 ⊢ (((𝑃 − 1) − (𝐶‘0)) ∈ ℕ ↔ (((𝑃 − 1) − (𝐶‘0)) ∈ ℤ ∧ 0 < ((𝑃 − 1) − (𝐶‘0))))
37	23, 35, 36	sylanbrc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ((𝑃 − 1) − (𝐶‘0)) ∈ ℕ)
38	37	0expd 14074	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (0↑((𝑃 − 1) − (𝐶‘0))) = 0)
39	9, 38	eqtrd 2772	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (𝐽↑((𝑃 − 1) − (𝐶‘0))) = 0)
40	39	oveq2d 7384	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0)))) = (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · 0))
41		nnm1nn0 12454	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
42	10, 41	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
43	42	faccld 14219	. . . . . . . . . . 11 ⊢ (𝜑 → (!‘(𝑃 − 1)) ∈ ℕ)
44	43	nncnd 12173	. . . . . . . . . 10 ⊢ (𝜑 → (!‘(𝑃 − 1)) ∈ ℂ)
45	44	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (!‘(𝑃 − 1)) ∈ ℂ)
46	37	nnnn0d 12474	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ((𝑃 − 1) − (𝐶‘0)) ∈ ℕ₀)
47	46	faccld 14219	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (!‘((𝑃 − 1) − (𝐶‘0))) ∈ ℕ)
48	47	nncnd 12173	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (!‘((𝑃 − 1) − (𝐶‘0))) ∈ ℂ)
49	47	nnne0d 12207	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (!‘((𝑃 − 1) − (𝐶‘0))) ≠ 0)
50	45, 48, 49	divcld 11929	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → ((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) ∈ ℂ)
51	50	mul01d 11344	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · 0) = 0)
52	6, 40, 51	3eqtrd 2776	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑃 − 1) < (𝐶‘0)) → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = 0)
53	4, 52	pm2.61dan 813	. . . . 5 ⊢ (𝜑 → if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) = 0)
54	53	oveq1d 7383	. . . 4 ⊢ (𝜑 → (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))) = (0 · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))))
55	7, 19	eqeltrd 2837	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ (0...𝑀))
56	10, 14, 55	etransclem7 46599	. . . . . 6 ⊢ (𝜑 → ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗))))) ∈ ℤ)
57	56	zcnd 12609	. . . . 5 ⊢ (𝜑 → ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗))))) ∈ ℂ)
58	57	mul02d 11343	. . . 4 ⊢ (𝜑 → (0 · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))) = 0)
59	54, 58	eqtrd 2772	. . 3 ⊢ (𝜑 → (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗)))))) = 0)
60	59	oveq2d 7384	. 2 ⊢ (𝜑 → (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · (if((𝑃 − 1) < (𝐶‘0), 0, (((!‘(𝑃 − 1)) / (!‘((𝑃 − 1) − (𝐶‘0)))) · (𝐽↑((𝑃 − 1) − (𝐶‘0))))) · ∏𝑗 ∈ (1...𝑀)if(𝑃 < (𝐶‘𝑗), 0, (((!‘𝑃) / (!‘(𝑃 − (𝐶‘𝑗)))) · ((𝐽 − 𝑗)↑(𝑃 − (𝐶‘𝑗))))))) = (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · 0))
61		etransclem15.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
62	61	faccld 14219	. . . . 5 ⊢ (𝜑 → (!‘𝑁) ∈ ℕ)
63	62	nncnd 12173	. . . 4 ⊢ (𝜑 → (!‘𝑁) ∈ ℂ)
64		fzfid 13908	. . . . 5 ⊢ (𝜑 → (0...𝑀) ∈ Fin)
65		fzssnn0 45678	. . . . . . . 8 ⊢ (0...𝑁) ⊆ ℕ₀
66	14	ffvelcdmda 7038	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (𝐶‘𝑗) ∈ (0...𝑁))
67	65, 66	sselid 3933	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (𝐶‘𝑗) ∈ ℕ₀)
68	67	faccld 14219	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (!‘(𝐶‘𝑗)) ∈ ℕ)
69	68	nncnd 12173	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (!‘(𝐶‘𝑗)) ∈ ℂ)
70	64, 69	fprodcl 15887	. . . 4 ⊢ (𝜑 → ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗)) ∈ ℂ)
71	68	nnne0d 12207	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (!‘(𝐶‘𝑗)) ≠ 0)
72	64, 69, 71	fprodn0 15914	. . . 4 ⊢ (𝜑 → ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗)) ≠ 0)
73	63, 70, 72	divcld 11929	. . 3 ⊢ (𝜑 → ((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) ∈ ℂ)
74	73	mul01d 11344	. 2 ⊢ (𝜑 → (((!‘𝑁) / ∏𝑗 ∈ (0...𝑀)(!‘(𝐶‘𝑗))) · 0) = 0)
75	2, 60, 74	3eqtrd 2776	1 ⊢ (𝜑 → 𝑇 = 0)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ifcif 4481 class class class wbr 5100 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 < clt 11178 − cmin 11376 / cdiv 11806 ℕcn 12157 ℕ₀cn0 12413 ℤcz 12500 ℤ_≥cuz 12763 ...cfz 13435 ↑cexp 13996 !cfa 14208 ∏cprod 15838

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-oi 9427 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-fz 13436 df-fzo 13583 df-seq 13937 df-exp 13997 df-fac 14209 df-bc 14238 df-hash 14266 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-clim 15423 df-prod 15839

This theorem is referenced by: etransclem28 46620

W3C validator