cxpeq - Metamath Proof Explorer

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

Theorem cxpeq 26265

Description: Solve an equation involving an 𝑁-th power. The expression -1↑_𝑐(2 / 𝑁) = exp(2πi / 𝑁) is a way to write the primitive 𝑁-th root of unity with the smallest positive argument. (Contributed by Mario Carneiro, 23-Apr-2015.)

**Assertion**
Ref	Expression
cxpeq	⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 ↔ ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))

Distinct variable groups: 𝐴,𝑛 𝐵,𝑛 𝑛,𝑁

Proof of Theorem cxpeq Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl2 1193	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝑁 ∈ ℕ)
2		nnm1nn0 12513	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ₀)
3	1, 2	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ ℕ₀)
4		nn0uz 12864	. . . . . . 7 ⊢ ℕ₀ = (ℤ_≥‘0)
5	3, 4	eleqtrdi 2844	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ (ℤ_≥‘0))
6		eluzfz1 13508	. . . . . 6 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝑁 − 1)))
7	5, 6	syl 17	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 0 ∈ (0...(𝑁 − 1)))
8		neg1cn 12326	. . . . . . . . . 10 ⊢ -1 ∈ ℂ
9		2re 12286	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
10		simp2 1138	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℕ)
11		nndivre 12253	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℕ) → (2 / 𝑁) ∈ ℝ)
12	9, 10, 11	sylancr 588	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℝ)
13	12	recnd 11242	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℂ)
14		cxpcl 26182	. . . . . . . . . 10 ⊢ ((-1 ∈ ℂ ∧ (2 / 𝑁) ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
15	8, 13, 14	sylancr 588	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
16	15	adantr 482	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
17		0nn0 12487	. . . . . . . 8 ⊢ 0 ∈ ℕ₀
18		expcl 14045	. . . . . . . 8 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 0 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
19	16, 17, 18	sylancl 587	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
20	19	mul02d 11412	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0 · ((-1↑_𝑐(2 / 𝑁))↑0)) = 0)
21		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = 0)
22	21	oveq1d 7424	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = (0↑𝑁))
23		simprr 772	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = 𝐵)
24	1	0expd 14104	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑𝑁) = 0)
25	22, 23, 24	3eqtr3d 2781	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐵 = 0)
26	25	oveq1d 7424	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = (0↑_𝑐(1 / 𝑁)))
27		nncn 12220	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
28		nnne0 12246	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
29		reccl 11879	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ∈ ℂ)
30		recne0 11885	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ≠ 0)
31	29, 30	0cxpd 26218	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (0↑_𝑐(1 / 𝑁)) = 0)
32	27, 28, 31	syl2anc 585	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (0↑_𝑐(1 / 𝑁)) = 0)
33	1, 32	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑_𝑐(1 / 𝑁)) = 0)
34	26, 33	eqtrd 2773	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = 0)
35	34	oveq1d 7424	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)) = (0 · ((-1↑_𝑐(2 / 𝑁))↑0)))
36	20, 35, 21	3eqtr4rd 2784	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
37		oveq2 7417	. . . . . . 7 ⊢ (𝑛 = 0 → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑0))
38	37	oveq2d 7425	. . . . . 6 ⊢ (𝑛 = 0 → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
39	38	rspceeqv 3634	. . . . 5 ⊢ ((0 ∈ (0...(𝑁 − 1)) ∧ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0))) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
40	7, 36, 39	syl2anc 585	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
41	40	expr 458	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 = 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
42		simpl1 1192	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
43		simpr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0)
44		simpl2 1193	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ)
45	44	nnzd 12585	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℤ)
46		explog 26102	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
47	42, 43, 45, 46	syl3anc 1372	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
48	47	eqcomd 2739	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁))
49	10	nncnd 12228	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℂ)
50	49	adantr 482	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℂ)
51	42, 43	logcld 26079	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘𝐴) ∈ ℂ)
52	50, 51	mulcld 11234	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝑁 · (log‘𝐴)) ∈ ℂ)
53	44	nnnn0d 12532	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ₀)
54	42, 53	expcld 14111	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ∈ ℂ)
55	42, 43, 45	expne0d 14117	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ≠ 0)
56		eflogeq 26110	. . . . . . 7 ⊢ (((𝑁 · (log‘𝐴)) ∈ ℂ ∧ (𝐴↑𝑁) ∈ ℂ ∧ (𝐴↑𝑁) ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
57	52, 54, 55, 56	syl3anc 1372	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
58	48, 57	mpbid 231	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)))
59	54, 55	logcld 26079	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘(𝐴↑𝑁)) ∈ ℂ)
60	59	adantr 482	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘(𝐴↑𝑁)) ∈ ℂ)
61		ax-icn 11169	. . . . . . . . . . 11 ⊢ i ∈ ℂ
62		2cn 12287	. . . . . . . . . . . 12 ⊢ 2 ∈ ℂ
63		picn 25969	. . . . . . . . . . . 12 ⊢ π ∈ ℂ
64	62, 63	mulcli 11221	. . . . . . . . . . 11 ⊢ (2 · π) ∈ ℂ
65	61, 64	mulcli 11221	. . . . . . . . . 10 ⊢ (i · (2 · π)) ∈ ℂ
66		zcn 12563	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
67	66	adantl 483	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℂ)
68		mulcl 11194	. . . . . . . . . 10 ⊢ (((i · (2 · π)) ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
69	65, 67, 68	sylancr 588	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
70	60, 69	addcld 11233	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) ∈ ℂ)
71	50	adantr 482	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℂ)
72	51	adantr 482	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘𝐴) ∈ ℂ)
73	10	nnne0d 12262	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ≠ 0)
74	73	ad2antrr 725	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ≠ 0)
75	70, 71, 72, 74	divmuld 12012	. . . . . . 7 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) ↔ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
76		fveq2 6892	. . . . . . . 8 ⊢ ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)))
77	71, 74	reccld 11983	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1 / 𝑁) ∈ ℂ)
78	77, 60	mulcld 11234	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ)
79	13	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (2 / 𝑁) ∈ ℂ)
80	79, 67	mulcld 11234	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 / 𝑁) · 𝑚) ∈ ℂ)
81	61, 63	mulcli 11221	. . . . . . . . . . . . 13 ⊢ (i · π) ∈ ℂ
82		mulcl 11194	. . . . . . . . . . . . 13 ⊢ ((((2 / 𝑁) · 𝑚) ∈ ℂ ∧ (i · π) ∈ ℂ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
83	80, 81, 82	sylancl 587	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
84		efadd 16037	. . . . . . . . . . . 12 ⊢ ((((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ ∧ (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
85	78, 83, 84	syl2anc 585	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
86	60, 69, 71, 74	divdird 12028	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)))
87	60, 71, 74	divrec2d 11994	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) / 𝑁) = ((1 / 𝑁) · (log‘(𝐴↑𝑁))))
88	65	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (i · (2 · π)) ∈ ℂ)
89	88, 67, 71, 74	div23d 12027	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((i · (2 · π)) / 𝑁) · 𝑚))
90	61, 62, 63	mul12i 11409	. . . . . . . . . . . . . . . . . 18 ⊢ (i · (2 · π)) = (2 · (i · π))
91	90	oveq1i 7419	. . . . . . . . . . . . . . . . 17 ⊢ ((i · (2 · π)) / 𝑁) = ((2 · (i · π)) / 𝑁)
92	62	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 2 ∈ ℂ)
93	81	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (i · π) ∈ ℂ)
94	92, 93, 71, 74	div23d 12027	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 · (i · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
95	91, 94	eqtrid 2785	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
96	95	oveq1d 7424	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) / 𝑁) · 𝑚) = (((2 / 𝑁) · (i · π)) · 𝑚))
97	79, 93, 67	mul32d 11424	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · (i · π)) · 𝑚) = (((2 / 𝑁) · 𝑚) · (i · π)))
98	89, 96, 97	3eqtrd 2777	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((2 / 𝑁) · 𝑚) · (i · π)))
99	87, 98	oveq12d 7427	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
100	86, 99	eqtrd 2773	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
101	100	fveq2d 6896	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))))
102	54	adantr 482	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ)
103	55	adantr 482	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ≠ 0)
104	102, 103, 77	cxpefd 26220	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))))
105	8	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ∈ ℂ)
106		neg1ne0 12328	. . . . . . . . . . . . . . 15 ⊢ -1 ≠ 0
107	106	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ≠ 0)
108		simpr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
109	105, 107, 79, 108	cxpmul2zd 26224	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = ((-1↑_𝑐(2 / 𝑁))↑𝑚))
110	105, 107, 80	cxpefd 26220	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))))
111		logm1 26097	. . . . . . . . . . . . . . . 16 ⊢ (log‘-1) = (i · π)
112	111	oveq2i 7420	. . . . . . . . . . . . . . 15 ⊢ (((2 / 𝑁) · 𝑚) · (log‘-1)) = (((2 / 𝑁) · 𝑚) · (i · π))
113	112	fveq2i 6895	. . . . . . . . . . . . . 14 ⊢ (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))
114	110, 113	eqtrdi 2789	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
115	105, 79	cxpcld 26216	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
116	8	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ∈ ℂ)
117	106	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ≠ 0)
118	116, 117, 13	cxpne0d 26221	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
119	118	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
120	115, 119, 108	expclzd 14116	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) ∈ ℂ)
121	44	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ)
122	108, 121	zmodcld 13857	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℕ₀)
123	115, 122	expcld 14111	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ∈ ℂ)
124	122	nn0zd 12584	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℤ)
125	115, 119, 124	expne0d 14117	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ≠ 0)
126	115, 119, 124, 108	expsubd 14122	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
127	121	nnzd 12585	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
128		zre 12562	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℝ)
129	121	nnrpd 13014	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℝ⁺)
130		moddifz 13848	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
131	128, 129, 130	syl2an2 685	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
132		expmulz 14074	. . . . . . . . . . . . . . . . 17 ⊢ ((((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ (-1↑_𝑐(2 / 𝑁)) ≠ 0) ∧ (𝑁 ∈ ℤ ∧ ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
133	115, 119, 127, 131, 132	syl22anc 838	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
134	122	nn0cnd 12534	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℂ)
135	67, 134	subcld 11571	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 − (𝑚 mod 𝑁)) ∈ ℂ)
136	135, 71, 74	divcan2d 11992	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (𝑚 − (𝑚 mod 𝑁)))
137	136	oveq2d 7425	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))))
138		root1id 26262	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
139	121, 138	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
140	139	oveq1d 7424	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
141		1exp 14057	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
142	131, 141	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
143	140, 142	eqtrd 2773	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
144	133, 137, 143	3eqtr3d 2781	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = 1)
145	126, 144	eqtr3d 2775	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 1)
146	120, 123, 125, 145	diveq1d 11998	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
147	109, 114, 146	3eqtr3rd 2782	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
148	104, 147	oveq12d 7427	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
149	85, 101, 148	3eqtr4d 2783	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
150		eflog 26085	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
151	42, 43, 150	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
152	151	adantr 482	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(log‘𝐴)) = 𝐴)
153	149, 152	eqeq12d 2749	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
154		zmodfz 13858	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
155	108, 121, 154	syl2anc 585	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
156		eqcom 2740	. . . . . . . . . . . . 13 ⊢ (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴)
157		oveq2 7417	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
158	157	oveq2d 7425	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑚 mod 𝑁) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
159	158	eqeq1d 2735	. . . . . . . . . . . . 13 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴 ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
160	156, 159	bitrid 283	. . . . . . . . . . . 12 ⊢ (𝑛 = (𝑚 mod 𝑁) → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
161	160	rspcev 3613	. . . . . . . . . . 11 ⊢ (((𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)) ∧ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
162	161	ex 414	. . . . . . . . . 10 ⊢ ((𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)) → ((((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
163	155, 162	syl 17	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
164	153, 163	sylbid 239	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
165	76, 164	syl5 34	. . . . . . 7 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
166	75, 165	sylbird 260	. . . . . 6 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
167	166	rexlimdva 3156	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
168	58, 167	mpd 15	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
169		oveq1 7416	. . . . . . 7 ⊢ ((𝐴↑𝑁) = 𝐵 → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (𝐵↑_𝑐(1 / 𝑁)))
170	169	oveq1d 7424	. . . . . 6 ⊢ ((𝐴↑𝑁) = 𝐵 → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
171	170	eqeq2d 2744	. . . . 5 ⊢ ((𝐴↑𝑁) = 𝐵 → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
172	171	rexbidv 3179	. . . 4 ⊢ ((𝐴↑𝑁) = 𝐵 → (∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
173	168, 172	syl5ibcom 244	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
174	41, 173	pm2.61dane 3030	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
175		simp3 1139	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
176		nnrecre 12254	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ)
177	176	3ad2ant2 1135	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℝ)
178	177	recnd 11242	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℂ)
179	175, 178	cxpcld 26216	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
180	179	adantr 482	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
181		elfznn0 13594	. . . . . . 7 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℕ₀)
182		expcl 14045	. . . . . . 7 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 𝑛 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
183	15, 181, 182	syl2an 597	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
184	10	adantr 482	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ)
185	184	nnnn0d 12532	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ₀)
186	180, 183, 185	mulexpd 14126	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)))
187	175	adantr 482	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝐵 ∈ ℂ)
188		cxproot 26198	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
189	187, 184, 188	syl2anc 585	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
190	181	adantl 483	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℕ₀)
191	190	nn0cnd 12534	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℂ)
192	184	nncnd 12228	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℂ)
193	191, 192	mulcomd 11235	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝑛 · 𝑁) = (𝑁 · 𝑛))
194	193	oveq2d 7425	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)))
195	15	adantr 482	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
196	195, 185, 190	expmuld 14114	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁))
197	195, 190, 185	expmuld 14114	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
198	194, 196, 197	3eqtr3d 2781	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
199	184, 138	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
200	199	oveq1d 7424	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛) = (1↑𝑛))
201		elfzelz 13501	. . . . . . . . 9 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℤ)
202	201	adantl 483	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℤ)
203		1exp 14057	. . . . . . . 8 ⊢ (𝑛 ∈ ℤ → (1↑𝑛) = 1)
204	202, 203	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (1↑𝑛) = 1)
205	198, 200, 204	3eqtrd 2777	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = 1)
206	189, 205	oveq12d 7427	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)) = (𝐵 · 1))
207	187	mulridd 11231	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵 · 1) = 𝐵)
208	186, 206, 207	3eqtrd 2777	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵)
209		oveq1 7416	. . . . 5 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁))
210	209	eqeq1d 2735	. . . 4 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → ((𝐴↑𝑁) = 𝐵 ↔ (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵))
211	208, 210	syl5ibrcom 246	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
212	211	rexlimdva 3156	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
213	174, 212	impbid 211	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 ↔ ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∃wrex 3071 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 ℝcr 11109 0cc0 11110 1c1 11111 ici 11112 + caddc 11113 · cmul 11115 − cmin 11444 -cneg 11445 / cdiv 11871 ℕcn 12212 2c2 12267 ℕ₀cn0 12472 ℤcz 12558 ℤ_≥cuz 12822 ℝ⁺crp 12974 ...cfz 13484 mod cmo 13834 ↑cexp 14027 expce 16005 πcpi 16010 logclog 26063 ↑_𝑐ccxp 26064

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189 ax-mulf 11190

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 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 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-om 7856 df-1st 7975 df-2nd 7976 df-supp 8147 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9362 df-fi 9406 df-sup 9437 df-inf 9438 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ioo 13328 df-ioc 13329 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-fac 14234 df-bc 14263 df-hash 14291 df-shft 15014 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-limsup 15415 df-clim 15432 df-rlim 15433 df-sum 15633 df-ef 16011 df-sin 16013 df-cos 16014 df-pi 16016 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-hom 17221 df-cco 17222 df-rest 17368 df-topn 17369 df-0g 17387 df-gsum 17388 df-topgen 17389 df-pt 17390 df-prds 17393 df-xrs 17448 df-qtop 17453 df-imas 17454 df-xps 17456 df-mre 17530 df-mrc 17531 df-acs 17533 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-submnd 18672 df-mulg 18951 df-cntz 19181 df-cmn 19650 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-fbas 20941 df-fg 20942 df-cnfld 20945 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-cld 22523 df-ntr 22524 df-cls 22525 df-nei 22602 df-lp 22640 df-perf 22641 df-cn 22731 df-cnp 22732 df-haus 22819 df-tx 23066 df-hmeo 23259 df-fil 23350 df-fm 23442 df-flim 23443 df-flf 23444 df-xms 23826 df-ms 23827 df-tms 23828 df-cncf 24394 df-limc 25383 df-dv 25384 df-log 26065 df-cxp 26066

This theorem is referenced by: 1cubr 26347

W3C validator