dvexp - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > dvexp		GIF version

Theorem dvexp 14558

Description: Derivative of a power function. (Contributed by Mario Carneiro, 9-Aug-2014.) (Revised by Mario Carneiro, 10-Feb-2015.)

**Assertion**
Ref	Expression
dvexp	⊢ (𝑁 ∈ ℕ → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1)))))

Distinct variable group: 𝑥,𝑁

Proof of Theorem dvexp Dummy variables 𝑘 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 5898	. . . . 5 ⊢ (𝑛 = 1 → (𝑥↑𝑛) = (𝑥↑1))
2	1	mpteq2dv 4108	. . . 4 ⊢ (𝑛 = 1 → (𝑥 ∈ ℂ ↦ (𝑥↑𝑛)) = (𝑥 ∈ ℂ ↦ (𝑥↑1)))
3	2	oveq2d 5906	. . 3 ⊢ (𝑛 = 1 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑1))))
4		id 19	. . . . 5 ⊢ (𝑛 = 1 → 𝑛 = 1)
5		oveq1 5897	. . . . . 6 ⊢ (𝑛 = 1 → (𝑛 − 1) = (1 − 1))
6	5	oveq2d 5906	. . . . 5 ⊢ (𝑛 = 1 → (𝑥↑(𝑛 − 1)) = (𝑥↑(1 − 1)))
7	4, 6	oveq12d 5908	. . . 4 ⊢ (𝑛 = 1 → (𝑛 · (𝑥↑(𝑛 − 1))) = (1 · (𝑥↑(1 − 1))))
8	7	mpteq2dv 4108	. . 3 ⊢ (𝑛 = 1 → (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) = (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1)))))
9	3, 8	eqeq12d 2203	. 2 ⊢ (𝑛 = 1 → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) ↔ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑1))) = (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1))))))
10		oveq2 5898	. . . . 5 ⊢ (𝑛 = 𝑘 → (𝑥↑𝑛) = (𝑥↑𝑘))
11	10	mpteq2dv 4108	. . . 4 ⊢ (𝑛 = 𝑘 → (𝑥 ∈ ℂ ↦ (𝑥↑𝑛)) = (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))
12	11	oveq2d 5906	. . 3 ⊢ (𝑛 = 𝑘 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))))
13		id 19	. . . . 5 ⊢ (𝑛 = 𝑘 → 𝑛 = 𝑘)
14		oveq1 5897	. . . . . 6 ⊢ (𝑛 = 𝑘 → (𝑛 − 1) = (𝑘 − 1))
15	14	oveq2d 5906	. . . . 5 ⊢ (𝑛 = 𝑘 → (𝑥↑(𝑛 − 1)) = (𝑥↑(𝑘 − 1)))
16	13, 15	oveq12d 5908	. . . 4 ⊢ (𝑛 = 𝑘 → (𝑛 · (𝑥↑(𝑛 − 1))) = (𝑘 · (𝑥↑(𝑘 − 1))))
17	16	mpteq2dv 4108	. . 3 ⊢ (𝑛 = 𝑘 → (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))))
18	12, 17	eqeq12d 2203	. 2 ⊢ (𝑛 = 𝑘 → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) ↔ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))))
19		oveq2 5898	. . . . 5 ⊢ (𝑛 = (𝑘 + 1) → (𝑥↑𝑛) = (𝑥↑(𝑘 + 1)))
20	19	mpteq2dv 4108	. . . 4 ⊢ (𝑛 = (𝑘 + 1) → (𝑥 ∈ ℂ ↦ (𝑥↑𝑛)) = (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1))))
21	20	oveq2d 5906	. . 3 ⊢ (𝑛 = (𝑘 + 1) → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))))
22		id 19	. . . . 5 ⊢ (𝑛 = (𝑘 + 1) → 𝑛 = (𝑘 + 1))
23		oveq1 5897	. . . . . 6 ⊢ (𝑛 = (𝑘 + 1) → (𝑛 − 1) = ((𝑘 + 1) − 1))
24	23	oveq2d 5906	. . . . 5 ⊢ (𝑛 = (𝑘 + 1) → (𝑥↑(𝑛 − 1)) = (𝑥↑((𝑘 + 1) − 1)))
25	22, 24	oveq12d 5908	. . . 4 ⊢ (𝑛 = (𝑘 + 1) → (𝑛 · (𝑥↑(𝑛 − 1))) = ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1))))
26	25	mpteq2dv 4108	. . 3 ⊢ (𝑛 = (𝑘 + 1) → (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) = (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1)))))
27	21, 26	eqeq12d 2203	. 2 ⊢ (𝑛 = (𝑘 + 1) → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) ↔ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))) = (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1))))))
28		oveq2 5898	. . . . 5 ⊢ (𝑛 = 𝑁 → (𝑥↑𝑛) = (𝑥↑𝑁))
29	28	mpteq2dv 4108	. . . 4 ⊢ (𝑛 = 𝑁 → (𝑥 ∈ ℂ ↦ (𝑥↑𝑛)) = (𝑥 ∈ ℂ ↦ (𝑥↑𝑁)))
30	29	oveq2d 5906	. . 3 ⊢ (𝑛 = 𝑁 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))))
31		id 19	. . . . 5 ⊢ (𝑛 = 𝑁 → 𝑛 = 𝑁)
32		oveq1 5897	. . . . . 6 ⊢ (𝑛 = 𝑁 → (𝑛 − 1) = (𝑁 − 1))
33	32	oveq2d 5906	. . . . 5 ⊢ (𝑛 = 𝑁 → (𝑥↑(𝑛 − 1)) = (𝑥↑(𝑁 − 1)))
34	31, 33	oveq12d 5908	. . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 · (𝑥↑(𝑛 − 1))) = (𝑁 · (𝑥↑(𝑁 − 1))))
35	34	mpteq2dv 4108	. . 3 ⊢ (𝑛 = 𝑁 → (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1)))))
36	30, 35	eqeq12d 2203	. 2 ⊢ (𝑛 = 𝑁 → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑛))) = (𝑥 ∈ ℂ ↦ (𝑛 · (𝑥↑(𝑛 − 1)))) ↔ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1))))))
37		exp1 10543	. . . . . 6 ⊢ (𝑥 ∈ ℂ → (𝑥↑1) = 𝑥)
38	37	mpteq2ia 4103	. . . . 5 ⊢ (𝑥 ∈ ℂ ↦ (𝑥↑1)) = (𝑥 ∈ ℂ ↦ 𝑥)
39		mptresid 4975	. . . . 5 ⊢ (𝑥 ∈ ℂ ↦ 𝑥) = ( I ↾ ℂ)
40	38, 39	eqtri 2209	. . . 4 ⊢ (𝑥 ∈ ℂ ↦ (𝑥↑1)) = ( I ↾ ℂ)
41	40	oveq2i 5901	. . 3 ⊢ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑1))) = (ℂ D ( I ↾ ℂ))
42		1m1e0 9005	. . . . . . . . . 10 ⊢ (1 − 1) = 0
43	42	oveq2i 5901	. . . . . . . . 9 ⊢ (𝑥↑(1 − 1)) = (𝑥↑0)
44		exp0 10541	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → (𝑥↑0) = 1)
45	43, 44	eqtrid 2233	. . . . . . . 8 ⊢ (𝑥 ∈ ℂ → (𝑥↑(1 − 1)) = 1)
46	45	oveq2d 5906	. . . . . . 7 ⊢ (𝑥 ∈ ℂ → (1 · (𝑥↑(1 − 1))) = (1 · 1))
47		1t1e1 9088	. . . . . . 7 ⊢ (1 · 1) = 1
48	46, 47	eqtrdi 2237	. . . . . 6 ⊢ (𝑥 ∈ ℂ → (1 · (𝑥↑(1 − 1))) = 1)
49	48	mpteq2ia 4103	. . . . 5 ⊢ (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1)))) = (𝑥 ∈ ℂ ↦ 1)
50		fconstmpt 4687	. . . . 5 ⊢ (ℂ × {1}) = (𝑥 ∈ ℂ ↦ 1)
51	49, 50	eqtr4i 2212	. . . 4 ⊢ (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1)))) = (ℂ × {1})
52		dvid 14545	. . . 4 ⊢ (ℂ D ( I ↾ ℂ)) = (ℂ × {1})
53	51, 52	eqtr4i 2212	. . 3 ⊢ (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1)))) = (ℂ D ( I ↾ ℂ))
54	41, 53	eqtr4i 2212	. 2 ⊢ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑1))) = (𝑥 ∈ ℂ ↦ (1 · (𝑥↑(1 − 1))))
55		nncn 8944	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℂ)
56	55	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → 𝑘 ∈ ℂ)
57		ax-1cn 7921	. . . . . . . . . . 11 ⊢ 1 ∈ ℂ
58		pncan 8180	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
59	56, 57, 58	sylancl 413	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
60	59	oveq2d 5906	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑥↑((𝑘 + 1) − 1)) = (𝑥↑𝑘))
61	60	oveq2d 5906	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1))) = ((𝑘 + 1) · (𝑥↑𝑘)))
62	57	a1i 9	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → 1 ∈ ℂ)
63		id 19	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → 𝑥 ∈ ℂ)
64		nnnn0 9200	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ₀)
65		expcl 10555	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑥↑𝑘) ∈ ℂ)
66	63, 64, 65	syl2anr 290	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑥↑𝑘) ∈ ℂ)
67	56, 62, 66	adddird 8000	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 + 1) · (𝑥↑𝑘)) = ((𝑘 · (𝑥↑𝑘)) + (1 · (𝑥↑𝑘))))
68	66	mulid2d 7993	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (1 · (𝑥↑𝑘)) = (𝑥↑𝑘))
69	68	oveq2d 5906	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 · (𝑥↑𝑘)) + (1 · (𝑥↑𝑘))) = ((𝑘 · (𝑥↑𝑘)) + (𝑥↑𝑘)))
70	61, 67, 69	3eqtrd 2225	. . . . . . 7 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1))) = ((𝑘 · (𝑥↑𝑘)) + (𝑥↑𝑘)))
71	70	mpteq2dva 4107	. . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1)))) = (𝑥 ∈ ℂ ↦ ((𝑘 · (𝑥↑𝑘)) + (𝑥↑𝑘))))
72		cnex 7952	. . . . . . . 8 ⊢ ℂ ∈ V
73	72	a1i 9	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → ℂ ∈ V)
74	56, 66	mulcld 7995	. . . . . . 7 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑘 · (𝑥↑𝑘)) ∈ ℂ)
75		nnm1nn0 9234	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ → (𝑘 − 1) ∈ ℕ₀)
76		expcl 10555	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ (𝑘 − 1) ∈ ℕ₀) → (𝑥↑(𝑘 − 1)) ∈ ℂ)
77	63, 75, 76	syl2anr 290	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑥↑(𝑘 − 1)) ∈ ℂ)
78	56, 77	mulcld 7995	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑘 · (𝑥↑(𝑘 − 1))) ∈ ℂ)
79		simpr 110	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ)
80		eqidd 2189	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))))
81	39	eqcomi 2192	. . . . . . . . . 10 ⊢ ( I ↾ ℂ) = (𝑥 ∈ ℂ ↦ 𝑥)
82	81	a1i 9	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → ( I ↾ ℂ) = (𝑥 ∈ ℂ ↦ 𝑥))
83	73, 78, 79, 80, 82	offval2 6115	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ ((𝑘 · (𝑥↑(𝑘 − 1))) · 𝑥)))
84	56, 77, 79	mulassd 7998	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 · (𝑥↑(𝑘 − 1))) · 𝑥) = (𝑘 · ((𝑥↑(𝑘 − 1)) · 𝑥)))
85		expm1t 10565	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℂ ∧ 𝑘 ∈ ℕ) → (𝑥↑𝑘) = ((𝑥↑(𝑘 − 1)) · 𝑥))
86	85	ancoms 268	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑥↑𝑘) = ((𝑥↑(𝑘 − 1)) · 𝑥))
87	86	oveq2d 5906	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑘 · (𝑥↑𝑘)) = (𝑘 · ((𝑥↑(𝑘 − 1)) · 𝑥)))
88	84, 87	eqtr4d 2224	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → ((𝑘 · (𝑥↑(𝑘 − 1))) · 𝑥) = (𝑘 · (𝑥↑𝑘)))
89	88	mpteq2dva 4107	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ ((𝑘 · (𝑥↑(𝑘 − 1))) · 𝑥)) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑𝑘))))
90	83, 89	eqtrd 2221	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑𝑘))))
91	52, 50	eqtri 2209	. . . . . . . . . 10 ⊢ (ℂ D ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ 1)
92	91	a1i 9	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (ℂ D ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ 1))
93		eqidd 2189	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) = (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))
94	73, 62, 66, 92, 93	offval2 6115	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (1 · (𝑥↑𝑘))))
95	68	mpteq2dva 4107	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (1 · (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))
96	94, 95	eqtrd 2221	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))
97	73, 74, 66, 90, 96	offval2 6115	. . . . . 6 ⊢ (𝑘 ∈ ℕ → (((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))) = (𝑥 ∈ ℂ ↦ ((𝑘 · (𝑥↑𝑘)) + (𝑥↑𝑘))))
98	71, 97	eqtr4d 2224	. . . . 5 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1)))) = (((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))))
99		oveq1 5897	. . . . . . 7 ⊢ ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) ∘_𝑓 · ( I ↾ ℂ)) = ((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)))
100	99	oveq1d 5905	. . . . . 6 ⊢ ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) → (((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))) = (((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))))
101	100	eqcomd 2194	. . . . 5 ⊢ ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) → (((𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))) = (((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))))
102	98, 101	sylan9eq 2241	. . . 4 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1)))) = (((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))))
103		cnelprrecn 7964	. . . . . 6 ⊢ ℂ ∈ {ℝ, ℂ}
104	103	a1i 9	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → ℂ ∈ {ℝ, ℂ})
105		ssidd 3190	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → ℂ ⊆ ℂ)
106	66	fmpttd 5686	. . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)):ℂ⟶ℂ)
107	106	adantr 276	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)):ℂ⟶ℂ)
108		f1oi 5513	. . . . . 6 ⊢ ( I ↾ ℂ):ℂ–1-1-onto→ℂ
109		f1of 5475	. . . . . 6 ⊢ (( I ↾ ℂ):ℂ–1-1-onto→ℂ → ( I ↾ ℂ):ℂ⟶ℂ)
110	108, 109	mp1i 10	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → ( I ↾ ℂ):ℂ⟶ℂ)
111		simpr 110	. . . . . . 7 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))))
112	111	dmeqd 4843	. . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → dom (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = dom (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))))
113	78	fmpttd 5686	. . . . . . . 8 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))):ℂ⟶ℂ)
114	113	adantr 276	. . . . . . 7 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))):ℂ⟶ℂ)
115	114	fdmd 5386	. . . . . 6 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → dom (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) = ℂ)
116	112, 115	eqtrd 2221	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → dom (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = ℂ)
117		1ex 7969	. . . . . . . . 9 ⊢ 1 ∈ V
118	117	fconst 5425	. . . . . . . 8 ⊢ (ℂ × {1}):ℂ⟶{1}
119	52	feq1i 5372	. . . . . . . 8 ⊢ ((ℂ D ( I ↾ ℂ)):ℂ⟶{1} ↔ (ℂ × {1}):ℂ⟶{1})
120	118, 119	mpbir 146	. . . . . . 7 ⊢ (ℂ D ( I ↾ ℂ)):ℂ⟶{1}
121	120	fdmi 5387	. . . . . 6 ⊢ dom (ℂ D ( I ↾ ℂ)) = ℂ
122	121	a1i 9	. . . . 5 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → dom (ℂ D ( I ↾ ℂ)) = ℂ)
123	104, 105, 107, 110, 116, 122	dvimulf 14553	. . . 4 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (ℂ D ((𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) ∘_𝑓 · ( I ↾ ℂ))) = (((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) ∘_𝑓 · ( I ↾ ℂ)) ∘_𝑓 + ((ℂ D ( I ↾ ℂ)) ∘_𝑓 · (𝑥 ∈ ℂ ↦ (𝑥↑𝑘)))))
124	73, 66, 79, 93, 82	offval2 6115	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) ∘_𝑓 · ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ ((𝑥↑𝑘) · 𝑥)))
125		expp1 10544	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑥↑(𝑘 + 1)) = ((𝑥↑𝑘) · 𝑥))
126	63, 64, 125	syl2anr 290	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ 𝑥 ∈ ℂ) → (𝑥↑(𝑘 + 1)) = ((𝑥↑𝑘) · 𝑥))
127	126	mpteq2dva 4107	. . . . . . 7 ⊢ (𝑘 ∈ ℕ → (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1))) = (𝑥 ∈ ℂ ↦ ((𝑥↑𝑘) · 𝑥)))
128	124, 127	eqtr4d 2224	. . . . . 6 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) ∘_𝑓 · ( I ↾ ℂ)) = (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1))))
129	128	oveq2d 5906	. . . . 5 ⊢ (𝑘 ∈ ℕ → (ℂ D ((𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) ∘_𝑓 · ( I ↾ ℂ))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))))
130	129	adantr 276	. . . 4 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (ℂ D ((𝑥 ∈ ℂ ↦ (𝑥↑𝑘)) ∘_𝑓 · ( I ↾ ℂ))) = (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))))
131	102, 123, 130	3eqtr2rd 2228	. . 3 ⊢ ((𝑘 ∈ ℕ ∧ (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1))))) → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))) = (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1)))))
132	131	ex 115	. 2 ⊢ (𝑘 ∈ ℕ → ((ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑘))) = (𝑥 ∈ ℂ ↦ (𝑘 · (𝑥↑(𝑘 − 1)))) → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑(𝑘 + 1)))) = (𝑥 ∈ ℂ ↦ ((𝑘 + 1) · (𝑥↑((𝑘 + 1) − 1))))))
133	9, 18, 27, 36, 54, 132	nnind 8952	1 ⊢ (𝑁 ∈ ℕ → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1)))))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1363 ∈ wcel 2159 Vcvv 2751 {csn 3606 {cpr 3607 ↦ cmpt 4078 I cid 4302 × cxp 4638 dom cdm 4640 ↾ cres 4642 ⟶wf 5226 –1-1-onto→wf1o 5229 (class class class)co 5890 ∘_𝑓 cof 6098 ℂcc 7826 ℝcr 7827 0cc0 7828 1c1 7829 + caddc 7831 · cmul 7833 − cmin 8145 ℕcn 8936 ℕ₀cn0 9193 ↑cexp 10536 D cdv 14507

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2161 ax-14 2162 ax-ext 2170 ax-coll 4132 ax-sep 4135 ax-nul 4143 ax-pow 4188 ax-pr 4223 ax-un 4447 ax-setind 4550 ax-iinf 4601 ax-cnex 7919 ax-resscn 7920 ax-1cn 7921 ax-1re 7922 ax-icn 7923 ax-addcl 7924 ax-addrcl 7925 ax-mulcl 7926 ax-mulrcl 7927 ax-addcom 7928 ax-mulcom 7929 ax-addass 7930 ax-mulass 7931 ax-distr 7932 ax-i2m1 7933 ax-0lt1 7934 ax-1rid 7935 ax-0id 7936 ax-rnegex 7937 ax-precex 7938 ax-cnre 7939 ax-pre-ltirr 7940 ax-pre-ltwlin 7941 ax-pre-lttrn 7942 ax-pre-apti 7943 ax-pre-ltadd 7944 ax-pre-mulgt0 7945 ax-pre-mulext 7946 ax-arch 7947 ax-caucvg 7948 ax-addf 7950 ax-mulf 7951

This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2040 df-mo 2041 df-clab 2175 df-cleq 2181 df-clel 2184 df-nfc 2320 df-ne 2360 df-nel 2455 df-ral 2472 df-rex 2473 df-reu 2474 df-rmo 2475 df-rab 2476 df-v 2753 df-sbc 2977 df-csb 3072 df-dif 3145 df-un 3147 df-in 3149 df-ss 3156 df-nul 3437 df-if 3549 df-pw 3591 df-sn 3612 df-pr 3613 df-op 3615 df-uni 3824 df-int 3859 df-iun 3902 df-br 4018 df-opab 4079 df-mpt 4080 df-tr 4116 df-id 4307 df-po 4310 df-iso 4311 df-iord 4380 df-on 4382 df-ilim 4383 df-suc 4385 df-iom 4604 df-xp 4646 df-rel 4647 df-cnv 4648 df-co 4649 df-dm 4650 df-rn 4651 df-res 4652 df-ima 4653 df-iota 5192 df-fun 5232 df-fn 5233 df-f 5234 df-f1 5235 df-fo 5236 df-f1o 5237 df-fv 5238 df-isom 5239 df-riota 5846 df-ov 5893 df-oprab 5894 df-mpo 5895 df-of 6100 df-1st 6158 df-2nd 6159 df-recs 6323 df-frec 6409 df-map 6667 df-pm 6668 df-sup 7000 df-inf 7001 df-pnf 8011 df-mnf 8012 df-xr 8013 df-ltxr 8014 df-le 8015 df-sub 8147 df-neg 8148 df-reap 8549 df-ap 8556 df-div 8647 df-inn 8937 df-2 8995 df-3 8996 df-4 8997 df-n0 9194 df-z 9271 df-uz 9546 df-q 9637 df-rp 9671 df-xneg 9789 df-xadd 9790 df-seqfrec 10463 df-exp 10537 df-cj 10868 df-re 10869 df-im 10870 df-rsqrt 11024 df-abs 11025 df-rest 12711 df-topgen 12730 df-psmet 13816 df-xmet 13817 df-met 13818 df-bl 13819 df-mopn 13820 df-top 13881 df-topon 13894 df-bases 13926 df-ntr 13979 df-cn 14071 df-cnp 14072 df-tx 14136 df-cncf 14441 df-limced 14508 df-dvap 14509

This theorem is referenced by: dvexp2 14559

W3C validator