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 26643

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 12459	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ₀)
3	1, 2	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ ℕ₀)
4		nn0uz 12811	. . . . . . 7 ⊢ ℕ₀ = (ℤ_≥‘0)
5	3, 4	eleqtrdi 2838	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ (ℤ_≥‘0))
6		eluzfz1 13468	. . . . . 6 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝑁 − 1)))
7	5, 6	syl 17	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 0 ∈ (0...(𝑁 − 1)))
8		neg1cn 12147	. . . . . . . . . 10 ⊢ -1 ∈ ℂ
9		2re 12236	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
10		simp2 1137	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℕ)
11		nndivre 12203	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℕ) → (2 / 𝑁) ∈ ℝ)
12	9, 10, 11	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℝ)
13	12	recnd 11178	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℂ)
14		cxpcl 26559	. . . . . . . . . 10 ⊢ ((-1 ∈ ℂ ∧ (2 / 𝑁) ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
15	8, 13, 14	sylancr 587	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
16	15	adantr 480	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
17		0nn0 12433	. . . . . . . 8 ⊢ 0 ∈ ℕ₀
18		expcl 14020	. . . . . . . 8 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 0 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
19	16, 17, 18	sylancl 586	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
20	19	mul02d 11348	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0 · ((-1↑_𝑐(2 / 𝑁))↑0)) = 0)
21		simprl 770	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = 0)
22	21	oveq1d 7384	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = (0↑𝑁))
23		simprr 772	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = 𝐵)
24	1	0expd 14080	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑𝑁) = 0)
25	22, 23, 24	3eqtr3d 2772	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐵 = 0)
26	25	oveq1d 7384	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = (0↑_𝑐(1 / 𝑁)))
27		nncn 12170	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
28		nnne0 12196	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
29		reccl 11820	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ∈ ℂ)
30		recne0 11826	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ≠ 0)
31	29, 30	0cxpd 26595	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (0↑_𝑐(1 / 𝑁)) = 0)
32	27, 28, 31	syl2anc 584	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (0↑_𝑐(1 / 𝑁)) = 0)
33	1, 32	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑_𝑐(1 / 𝑁)) = 0)
34	26, 33	eqtrd 2764	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = 0)
35	34	oveq1d 7384	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)) = (0 · ((-1↑_𝑐(2 / 𝑁))↑0)))
36	20, 35, 21	3eqtr4rd 2775	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
37		oveq2 7377	. . . . . . 7 ⊢ (𝑛 = 0 → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑0))
38	37	oveq2d 7385	. . . . . 6 ⊢ (𝑛 = 0 → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
39	38	rspceeqv 3608	. . . . 5 ⊢ ((0 ∈ (0...(𝑁 − 1)) ∧ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0))) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
40	7, 36, 39	syl2anc 584	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
41	40	expr 456	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 = 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
42		simpl1 1192	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
43		simpr 484	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0)
44		simpl2 1193	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ)
45	44	nnzd 12532	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℤ)
46		explog 26479	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
47	42, 43, 45, 46	syl3anc 1373	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
48	47	eqcomd 2735	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁))
49	10	nncnd 12178	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℂ)
50	49	adantr 480	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℂ)
51	42, 43	logcld 26455	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘𝐴) ∈ ℂ)
52	50, 51	mulcld 11170	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝑁 · (log‘𝐴)) ∈ ℂ)
53	44	nnnn0d 12479	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ₀)
54	42, 53	expcld 14087	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ∈ ℂ)
55	42, 43, 45	expne0d 14093	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ≠ 0)
56		eflogeq 26487	. . . . . . 7 ⊢ (((𝑁 · (log‘𝐴)) ∈ ℂ ∧ (𝐴↑𝑁) ∈ ℂ ∧ (𝐴↑𝑁) ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
57	52, 54, 55, 56	syl3anc 1373	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
58	48, 57	mpbid 232	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)))
59	54, 55	logcld 26455	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘(𝐴↑𝑁)) ∈ ℂ)
60	59	adantr 480	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘(𝐴↑𝑁)) ∈ ℂ)
61		ax-icn 11103	. . . . . . . . . . 11 ⊢ i ∈ ℂ
62		2cn 12237	. . . . . . . . . . . 12 ⊢ 2 ∈ ℂ
63		picn 26343	. . . . . . . . . . . 12 ⊢ π ∈ ℂ
64	62, 63	mulcli 11157	. . . . . . . . . . 11 ⊢ (2 · π) ∈ ℂ
65	61, 64	mulcli 11157	. . . . . . . . . 10 ⊢ (i · (2 · π)) ∈ ℂ
66		zcn 12510	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
67	66	adantl 481	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℂ)
68		mulcl 11128	. . . . . . . . . 10 ⊢ (((i · (2 · π)) ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
69	65, 67, 68	sylancr 587	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
70	60, 69	addcld 11169	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) ∈ ℂ)
71	50	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℂ)
72	51	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘𝐴) ∈ ℂ)
73	10	nnne0d 12212	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ≠ 0)
74	73	ad2antrr 726	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ≠ 0)
75	70, 71, 72, 74	divmuld 11956	. . . . . . 7 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) ↔ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
76		fveq2 6840	. . . . . . . 8 ⊢ ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)))
77	71, 74	reccld 11927	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1 / 𝑁) ∈ ℂ)
78	77, 60	mulcld 11170	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ)
79	13	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (2 / 𝑁) ∈ ℂ)
80	79, 67	mulcld 11170	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 / 𝑁) · 𝑚) ∈ ℂ)
81	61, 63	mulcli 11157	. . . . . . . . . . . . 13 ⊢ (i · π) ∈ ℂ
82		mulcl 11128	. . . . . . . . . . . . 13 ⊢ ((((2 / 𝑁) · 𝑚) ∈ ℂ ∧ (i · π) ∈ ℂ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
83	80, 81, 82	sylancl 586	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
84		efadd 16036	. . . . . . . . . . . 12 ⊢ ((((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ ∧ (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
85	78, 83, 84	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
86	60, 69, 71, 74	divdird 11972	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)))
87	60, 71, 74	divrec2d 11938	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) / 𝑁) = ((1 / 𝑁) · (log‘(𝐴↑𝑁))))
88	65	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (i · (2 · π)) ∈ ℂ)
89	88, 67, 71, 74	div23d 11971	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((i · (2 · π)) / 𝑁) · 𝑚))
90	61, 62, 63	mul12i 11345	. . . . . . . . . . . . . . . . . 18 ⊢ (i · (2 · π)) = (2 · (i · π))
91	90	oveq1i 7379	. . . . . . . . . . . . . . . . 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 11971	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 · (i · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
95	91, 94	eqtrid 2776	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
96	95	oveq1d 7384	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) / 𝑁) · 𝑚) = (((2 / 𝑁) · (i · π)) · 𝑚))
97	79, 93, 67	mul32d 11360	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · (i · π)) · 𝑚) = (((2 / 𝑁) · 𝑚) · (i · π)))
98	89, 96, 97	3eqtrd 2768	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((2 / 𝑁) · 𝑚) · (i · π)))
99	87, 98	oveq12d 7387	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
100	86, 99	eqtrd 2764	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
101	100	fveq2d 6844	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))))
102	54	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ)
103	55	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ≠ 0)
104	102, 103, 77	cxpefd 26597	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))))
105	8	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ∈ ℂ)
106		neg1ne0 12149	. . . . . . . . . . . . . . 15 ⊢ -1 ≠ 0
107	106	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ≠ 0)
108		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
109	105, 107, 79, 108	cxpmul2zd 26601	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = ((-1↑_𝑐(2 / 𝑁))↑𝑚))
110	105, 107, 80	cxpefd 26597	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))))
111		logm1 26474	. . . . . . . . . . . . . . . 16 ⊢ (log‘-1) = (i · π)
112	111	oveq2i 7380	. . . . . . . . . . . . . . 15 ⊢ (((2 / 𝑁) · 𝑚) · (log‘-1)) = (((2 / 𝑁) · 𝑚) · (i · π))
113	112	fveq2i 6843	. . . . . . . . . . . . . 14 ⊢ (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))
114	110, 113	eqtrdi 2780	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
115	105, 79	cxpcld 26593	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
116	8	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ∈ ℂ)
117	106	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ≠ 0)
118	116, 117, 13	cxpne0d 26598	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
119	118	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
120	115, 119, 108	expclzd 14092	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) ∈ ℂ)
121	44	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ)
122	108, 121	zmodcld 13830	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℕ₀)
123	115, 122	expcld 14087	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ∈ ℂ)
124	122	nn0zd 12531	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℤ)
125	115, 119, 124	expne0d 14093	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ≠ 0)
126	115, 119, 124, 108	expsubd 14098	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
127	121	nnzd 12532	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
128		zre 12509	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℝ)
129	121	nnrpd 12969	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℝ⁺)
130		moddifz 13821	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
131	128, 129, 130	syl2an2 686	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
132		expmulz 14049	. . . . . . . . . . . . . . . . 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 12481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℂ)
135	67, 134	subcld 11509	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 − (𝑚 mod 𝑁)) ∈ ℂ)
136	135, 71, 74	divcan2d 11936	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (𝑚 − (𝑚 mod 𝑁)))
137	136	oveq2d 7385	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))))
138		root1id 26640	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
139	121, 138	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
140	139	oveq1d 7384	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
141		1exp 14032	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
142	131, 141	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
143	140, 142	eqtrd 2764	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
144	133, 137, 143	3eqtr3d 2772	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = 1)
145	126, 144	eqtr3d 2766	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 1)
146	120, 123, 125, 145	diveq1d 11942	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
147	109, 114, 146	3eqtr3rd 2773	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
148	104, 147	oveq12d 7387	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
149	85, 101, 148	3eqtr4d 2774	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
150		eflog 26461	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
151	42, 43, 150	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
152	151	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(log‘𝐴)) = 𝐴)
153	149, 152	eqeq12d 2745	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
154		zmodfz 13831	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
155	108, 121, 154	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
156		eqcom 2736	. . . . . . . . . . . . 13 ⊢ (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴)
157		oveq2 7377	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
158	157	oveq2d 7385	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑚 mod 𝑁) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
159	158	eqeq1d 2731	. . . . . . . . . . . . 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 3585	. . . . . . . . . . 11 ⊢ (((𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)) ∧ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
162	161	ex 412	. . . . . . . . . 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 240	. . . . . . . 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 3134	. . . . 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 7376	. . . . . . 7 ⊢ ((𝐴↑𝑁) = 𝐵 → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (𝐵↑_𝑐(1 / 𝑁)))
170	169	oveq1d 7384	. . . . . 6 ⊢ ((𝐴↑𝑁) = 𝐵 → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
171	170	eqeq2d 2740	. . . . 5 ⊢ ((𝐴↑𝑁) = 𝐵 → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
172	171	rexbidv 3157	. . . 4 ⊢ ((𝐴↑𝑁) = 𝐵 → (∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
173	168, 172	syl5ibcom 245	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
174	41, 173	pm2.61dane 3012	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
175		simp3 1138	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
176		nnrecre 12204	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ)
177	176	3ad2ant2 1134	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℝ)
178	177	recnd 11178	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℂ)
179	175, 178	cxpcld 26593	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
180	179	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
181		elfznn0 13557	. . . . . . 7 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℕ₀)
182		expcl 14020	. . . . . . 7 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 𝑛 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
183	15, 181, 182	syl2an 596	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
184	10	adantr 480	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ)
185	184	nnnn0d 12479	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ₀)
186	180, 183, 185	mulexpd 14102	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)))
187	175	adantr 480	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝐵 ∈ ℂ)
188		cxproot 26575	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
189	187, 184, 188	syl2anc 584	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
190	181	adantl 481	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℕ₀)
191	190	nn0cnd 12481	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℂ)
192	184	nncnd 12178	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℂ)
193	191, 192	mulcomd 11171	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝑛 · 𝑁) = (𝑁 · 𝑛))
194	193	oveq2d 7385	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)))
195	15	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
196	195, 185, 190	expmuld 14090	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁))
197	195, 190, 185	expmuld 14090	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
198	194, 196, 197	3eqtr3d 2772	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
199	184, 138	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
200	199	oveq1d 7384	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛) = (1↑𝑛))
201		elfzelz 13461	. . . . . . . . 9 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℤ)
202	201	adantl 481	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℤ)
203		1exp 14032	. . . . . . . 8 ⊢ (𝑛 ∈ ℤ → (1↑𝑛) = 1)
204	202, 203	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (1↑𝑛) = 1)
205	198, 200, 204	3eqtrd 2768	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = 1)
206	189, 205	oveq12d 7387	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)) = (𝐵 · 1))
207	187	mulridd 11167	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵 · 1) = 𝐵)
208	186, 206, 207	3eqtrd 2768	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵)
209		oveq1 7376	. . . . 5 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁))
210	209	eqeq1d 2731	. . . 4 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → ((𝐴↑𝑁) = 𝐵 ↔ (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵))
211	208, 210	syl5ibrcom 247	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
212	211	rexlimdva 3134	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
213	174, 212	impbid 212	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 ↔ ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 ‘cfv 6499 (class class class)co 7369 ℂcc 11042 ℝcr 11043 0cc0 11044 1c1 11045 ici 11046 + caddc 11047 · cmul 11049 − cmin 11381 -cneg 11382 / cdiv 11811 ℕcn 12162 2c2 12217 ℕ₀cn0 12418 ℤcz 12505 ℤ_≥cuz 12769 ℝ⁺crp 12927 ...cfz 13444 mod cmo 13807 ↑cexp 14002 expce 16003 πcpi 16008 logclog 26439 ↑_𝑐ccxp 26440

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-inf2 9570 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 ax-addf 11123

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-of 7633 df-om 7823 df-1st 7947 df-2nd 7948 df-supp 8117 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-map 8778 df-pm 8779 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9289 df-fi 9338 df-sup 9369 df-inf 9370 df-oi 9439 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-z 12506 df-dec 12626 df-uz 12770 df-q 12884 df-rp 12928 df-xneg 13048 df-xadd 13049 df-xmul 13050 df-ioo 13286 df-ioc 13287 df-ico 13288 df-icc 13289 df-fz 13445 df-fzo 13592 df-fl 13730 df-mod 13808 df-seq 13943 df-exp 14003 df-fac 14215 df-bc 14244 df-hash 14272 df-shft 15009 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-limsup 15413 df-clim 15430 df-rlim 15431 df-sum 15629 df-ef 16009 df-sin 16011 df-cos 16012 df-pi 16014 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-starv 17211 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-hom 17220 df-cco 17221 df-rest 17361 df-topn 17362 df-0g 17380 df-gsum 17381 df-topgen 17382 df-pt 17383 df-prds 17386 df-xrs 17441 df-qtop 17446 df-imas 17447 df-xps 17449 df-mre 17523 df-mrc 17524 df-acs 17526 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-submnd 18687 df-mulg 18976 df-cntz 19225 df-cmn 19688 df-psmet 21232 df-xmet 21233 df-met 21234 df-bl 21235 df-mopn 21236 df-fbas 21237 df-fg 21238 df-cnfld 21241 df-top 22757 df-topon 22774 df-topsp 22796 df-bases 22809 df-cld 22882 df-ntr 22883 df-cls 22884 df-nei 22961 df-lp 22999 df-perf 23000 df-cn 23090 df-cnp 23091 df-haus 23178 df-tx 23425 df-hmeo 23618 df-fil 23709 df-fm 23801 df-flim 23802 df-flf 23803 df-xms 24184 df-ms 24185 df-tms 24186 df-cncf 24747 df-limc 25743 df-dv 25744 df-log 26441 df-cxp 26442

This theorem is referenced by: 1cubr 26728

W3C validator