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 25919

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 1191	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝑁 ∈ ℕ)
2		nnm1nn0 12283	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ₀)
3	1, 2	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ ℕ₀)
4		nn0uz 12629	. . . . . . 7 ⊢ ℕ₀ = (ℤ_≥‘0)
5	3, 4	eleqtrdi 2850	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ (ℤ_≥‘0))
6		eluzfz1 13272	. . . . . 6 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝑁 − 1)))
7	5, 6	syl 17	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 0 ∈ (0...(𝑁 − 1)))
8		neg1cn 12096	. . . . . . . . . 10 ⊢ -1 ∈ ℂ
9		2re 12056	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
10		simp2 1136	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℕ)
11		nndivre 12023	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℕ) → (2 / 𝑁) ∈ ℝ)
12	9, 10, 11	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℝ)
13	12	recnd 11012	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℂ)
14		cxpcl 25838	. . . . . . . . . 10 ⊢ ((-1 ∈ ℂ ∧ (2 / 𝑁) ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
15	8, 13, 14	sylancr 587	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
16	15	adantr 481	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
17		0nn0 12257	. . . . . . . 8 ⊢ 0 ∈ ℕ₀
18		expcl 13809	. . . . . . . 8 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 0 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
19	16, 17, 18	sylancl 586	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
20	19	mul02d 11182	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0 · ((-1↑_𝑐(2 / 𝑁))↑0)) = 0)
21		simprl 768	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = 0)
22	21	oveq1d 7299	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = (0↑𝑁))
23		simprr 770	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = 𝐵)
24	1	0expd 13866	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑𝑁) = 0)
25	22, 23, 24	3eqtr3d 2787	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐵 = 0)
26	25	oveq1d 7299	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = (0↑_𝑐(1 / 𝑁)))
27		nncn 11990	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
28		nnne0 12016	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
29		reccl 11649	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ∈ ℂ)
30		recne0 11655	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ≠ 0)
31	29, 30	0cxpd 25874	. . . . . . . . . 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 2779	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = 0)
35	34	oveq1d 7299	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)) = (0 · ((-1↑_𝑐(2 / 𝑁))↑0)))
36	20, 35, 21	3eqtr4rd 2790	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
37		oveq2 7292	. . . . . . 7 ⊢ (𝑛 = 0 → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑0))
38	37	oveq2d 7300	. . . . . 6 ⊢ (𝑛 = 0 → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
39	38	rspceeqv 3576	. . . . 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 457	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 = 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
42		simpl1 1190	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
43		simpr 485	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0)
44		simpl2 1191	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ)
45	44	nnzd 12434	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℤ)
46		explog 25758	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
47	42, 43, 45, 46	syl3anc 1370	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
48	47	eqcomd 2745	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁))
49	10	nncnd 11998	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℂ)
50	49	adantr 481	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℂ)
51	42, 43	logcld 25735	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘𝐴) ∈ ℂ)
52	50, 51	mulcld 11004	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝑁 · (log‘𝐴)) ∈ ℂ)
53	44	nnnn0d 12302	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ₀)
54	42, 53	expcld 13873	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ∈ ℂ)
55	42, 43, 45	expne0d 13879	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ≠ 0)
56		eflogeq 25766	. . . . . . 7 ⊢ (((𝑁 · (log‘𝐴)) ∈ ℂ ∧ (𝐴↑𝑁) ∈ ℂ ∧ (𝐴↑𝑁) ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
57	52, 54, 55, 56	syl3anc 1370	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
58	48, 57	mpbid 231	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)))
59	54, 55	logcld 25735	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘(𝐴↑𝑁)) ∈ ℂ)
60	59	adantr 481	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘(𝐴↑𝑁)) ∈ ℂ)
61		ax-icn 10939	. . . . . . . . . . 11 ⊢ i ∈ ℂ
62		2cn 12057	. . . . . . . . . . . 12 ⊢ 2 ∈ ℂ
63		picn 25625	. . . . . . . . . . . 12 ⊢ π ∈ ℂ
64	62, 63	mulcli 10991	. . . . . . . . . . 11 ⊢ (2 · π) ∈ ℂ
65	61, 64	mulcli 10991	. . . . . . . . . 10 ⊢ (i · (2 · π)) ∈ ℂ
66		zcn 12333	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
67	66	adantl 482	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℂ)
68		mulcl 10964	. . . . . . . . . 10 ⊢ (((i · (2 · π)) ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
69	65, 67, 68	sylancr 587	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
70	60, 69	addcld 11003	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) ∈ ℂ)
71	50	adantr 481	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℂ)
72	51	adantr 481	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘𝐴) ∈ ℂ)
73	10	nnne0d 12032	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ≠ 0)
74	73	ad2antrr 723	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ≠ 0)
75	70, 71, 72, 74	divmuld 11782	. . . . . . 7 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) ↔ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
76		fveq2 6783	. . . . . . . 8 ⊢ ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)))
77	71, 74	reccld 11753	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1 / 𝑁) ∈ ℂ)
78	77, 60	mulcld 11004	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ)
79	13	ad2antrr 723	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (2 / 𝑁) ∈ ℂ)
80	79, 67	mulcld 11004	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 / 𝑁) · 𝑚) ∈ ℂ)
81	61, 63	mulcli 10991	. . . . . . . . . . . . 13 ⊢ (i · π) ∈ ℂ
82		mulcl 10964	. . . . . . . . . . . . 13 ⊢ ((((2 / 𝑁) · 𝑚) ∈ ℂ ∧ (i · π) ∈ ℂ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
83	80, 81, 82	sylancl 586	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
84		efadd 15812	. . . . . . . . . . . 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 11798	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)))
87	60, 71, 74	divrec2d 11764	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) / 𝑁) = ((1 / 𝑁) · (log‘(𝐴↑𝑁))))
88	65	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (i · (2 · π)) ∈ ℂ)
89	88, 67, 71, 74	div23d 11797	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((i · (2 · π)) / 𝑁) · 𝑚))
90	61, 62, 63	mul12i 11179	. . . . . . . . . . . . . . . . . 18 ⊢ (i · (2 · π)) = (2 · (i · π))
91	90	oveq1i 7294	. . . . . . . . . . . . . . . . 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 11797	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 · (i · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
95	91, 94	eqtrid 2791	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
96	95	oveq1d 7299	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) / 𝑁) · 𝑚) = (((2 / 𝑁) · (i · π)) · 𝑚))
97	79, 93, 67	mul32d 11194	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · (i · π)) · 𝑚) = (((2 / 𝑁) · 𝑚) · (i · π)))
98	89, 96, 97	3eqtrd 2783	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((2 / 𝑁) · 𝑚) · (i · π)))
99	87, 98	oveq12d 7302	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
100	86, 99	eqtrd 2779	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
101	100	fveq2d 6787	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))))
102	54	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ∈ ℂ)
103	55	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝐴↑𝑁) ≠ 0)
104	102, 103, 77	cxpefd 25876	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))))
105	8	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ∈ ℂ)
106		neg1ne0 12098	. . . . . . . . . . . . . . 15 ⊢ -1 ≠ 0
107	106	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ≠ 0)
108		simpr 485	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
109	105, 107, 79, 108	cxpmul2zd 25880	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = ((-1↑_𝑐(2 / 𝑁))↑𝑚))
110	105, 107, 80	cxpefd 25876	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))))
111		logm1 25753	. . . . . . . . . . . . . . . 16 ⊢ (log‘-1) = (i · π)
112	111	oveq2i 7295	. . . . . . . . . . . . . . 15 ⊢ (((2 / 𝑁) · 𝑚) · (log‘-1)) = (((2 / 𝑁) · 𝑚) · (i · π))
113	112	fveq2i 6786	. . . . . . . . . . . . . 14 ⊢ (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))
114	110, 113	eqtrdi 2795	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
115	105, 79	cxpcld 25872	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
116	8	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ∈ ℂ)
117	106	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ≠ 0)
118	116, 117, 13	cxpne0d 25877	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
119	118	ad2antrr 723	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
120	115, 119, 108	expclzd 13878	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) ∈ ℂ)
121	44	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ)
122	108, 121	zmodcld 13621	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℕ₀)
123	115, 122	expcld 13873	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ∈ ℂ)
124	122	nn0zd 12433	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℤ)
125	115, 119, 124	expne0d 13879	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ≠ 0)
126	115, 119, 124, 108	expsubd 13884	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
127	121	nnzd 12434	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
128		zre 12332	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℝ)
129	121	nnrpd 12779	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℝ⁺)
130		moddifz 13612	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
131	128, 129, 130	syl2an2 683	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
132		expmulz 13838	. . . . . . . . . . . . . . . . 17 ⊢ ((((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ (-1↑_𝑐(2 / 𝑁)) ≠ 0) ∧ (𝑁 ∈ ℤ ∧ ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
133	115, 119, 127, 131, 132	syl22anc 836	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
134	122	nn0cnd 12304	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℂ)
135	67, 134	subcld 11341	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 − (𝑚 mod 𝑁)) ∈ ℂ)
136	135, 71, 74	divcan2d 11762	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (𝑚 − (𝑚 mod 𝑁)))
137	136	oveq2d 7300	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))))
138		root1id 25916	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
139	121, 138	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
140	139	oveq1d 7299	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
141		1exp 13821	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
142	131, 141	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
143	140, 142	eqtrd 2779	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
144	133, 137, 143	3eqtr3d 2787	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = 1)
145	126, 144	eqtr3d 2781	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 1)
146	120, 123, 125, 145	diveq1d 11768	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
147	109, 114, 146	3eqtr3rd 2788	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
148	104, 147	oveq12d 7302	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
149	85, 101, 148	3eqtr4d 2789	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
150		eflog 25741	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
151	42, 43, 150	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
152	151	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(log‘𝐴)) = 𝐴)
153	149, 152	eqeq12d 2755	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
154		zmodfz 13622	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
155	108, 121, 154	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
156		eqcom 2746	. . . . . . . . . . . . 13 ⊢ (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴)
157		oveq2 7292	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
158	157	oveq2d 7300	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑚 mod 𝑁) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
159	158	eqeq1d 2741	. . . . . . . . . . . . 13 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴 ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
160	156, 159	bitrid 282	. . . . . . . . . . . 12 ⊢ (𝑛 = (𝑚 mod 𝑁) → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
161	160	rspcev 3562	. . . . . . . . . . 11 ⊢ (((𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)) ∧ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
162	161	ex 413	. . . . . . . . . 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 259	. . . . . 6 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
167	166	rexlimdva 3214	. . . . 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 7291	. . . . . . 7 ⊢ ((𝐴↑𝑁) = 𝐵 → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (𝐵↑_𝑐(1 / 𝑁)))
170	169	oveq1d 7299	. . . . . 6 ⊢ ((𝐴↑𝑁) = 𝐵 → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
171	170	eqeq2d 2750	. . . . 5 ⊢ ((𝐴↑𝑁) = 𝐵 → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
172	171	rexbidv 3227	. . . 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 3033	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
175		simp3 1137	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
176		nnrecre 12024	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ)
177	176	3ad2ant2 1133	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℝ)
178	177	recnd 11012	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℂ)
179	175, 178	cxpcld 25872	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
180	179	adantr 481	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
181		elfznn0 13358	. . . . . . 7 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℕ₀)
182		expcl 13809	. . . . . . 7 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 𝑛 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
183	15, 181, 182	syl2an 596	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
184	10	adantr 481	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ)
185	184	nnnn0d 12302	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ₀)
186	180, 183, 185	mulexpd 13888	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)))
187	175	adantr 481	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝐵 ∈ ℂ)
188		cxproot 25854	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
189	187, 184, 188	syl2anc 584	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
190	181	adantl 482	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℕ₀)
191	190	nn0cnd 12304	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℂ)
192	184	nncnd 11998	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℂ)
193	191, 192	mulcomd 11005	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝑛 · 𝑁) = (𝑁 · 𝑛))
194	193	oveq2d 7300	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)))
195	15	adantr 481	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
196	195, 185, 190	expmuld 13876	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁))
197	195, 190, 185	expmuld 13876	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
198	194, 196, 197	3eqtr3d 2787	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
199	184, 138	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
200	199	oveq1d 7299	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛) = (1↑𝑛))
201		elfzelz 13265	. . . . . . . . 9 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℤ)
202	201	adantl 482	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℤ)
203		1exp 13821	. . . . . . . 8 ⊢ (𝑛 ∈ ℤ → (1↑𝑛) = 1)
204	202, 203	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (1↑𝑛) = 1)
205	198, 200, 204	3eqtrd 2783	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = 1)
206	189, 205	oveq12d 7302	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)) = (𝐵 · 1))
207	187	mulid1d 11001	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵 · 1) = 𝐵)
208	186, 206, 207	3eqtrd 2783	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵)
209		oveq1 7291	. . . . 5 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁))
210	209	eqeq1d 2741	. . . 4 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → ((𝐴↑𝑁) = 𝐵 ↔ (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵))
211	208, 210	syl5ibrcom 246	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
212	211	rexlimdva 3214	. 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 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2944 ∃wrex 3066 ‘cfv 6437 (class class class)co 7284 ℂcc 10878 ℝcr 10879 0cc0 10880 1c1 10881 ici 10882 + caddc 10883 · cmul 10885 − cmin 11214 -cneg 11215 / cdiv 11641 ℕcn 11982 2c2 12037 ℕ₀cn0 12242 ℤcz 12328 ℤ_≥cuz 12591 ℝ⁺crp 12739 ...cfz 13248 mod cmo 13598 ↑cexp 13791 expce 15780 πcpi 15785 logclog 25719 ↑_𝑐ccxp 25720

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 2710 ax-rep 5210 ax-sep 5224 ax-nul 5231 ax-pow 5289 ax-pr 5353 ax-un 7597 ax-inf2 9408 ax-cnex 10936 ax-resscn 10937 ax-1cn 10938 ax-icn 10939 ax-addcl 10940 ax-addrcl 10941 ax-mulcl 10942 ax-mulrcl 10943 ax-mulcom 10944 ax-addass 10945 ax-mulass 10946 ax-distr 10947 ax-i2m1 10948 ax-1ne0 10949 ax-1rid 10950 ax-rnegex 10951 ax-rrecex 10952 ax-cnre 10953 ax-pre-lttri 10954 ax-pre-lttrn 10955 ax-pre-ltadd 10956 ax-pre-mulgt0 10957 ax-pre-sup 10958 ax-addf 10959 ax-mulf 10960

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-rmo 3072 df-reu 3073 df-rab 3074 df-v 3435 df-sbc 3718 df-csb 3834 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-pss 3907 df-nul 4258 df-if 4461 df-pw 4536 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4841 df-int 4881 df-iun 4927 df-iin 4928 df-br 5076 df-opab 5138 df-mpt 5159 df-tr 5193 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-se 5546 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6206 df-ord 6273 df-on 6274 df-lim 6275 df-suc 6276 df-iota 6395 df-fun 6439 df-fn 6440 df-f 6441 df-f1 6442 df-fo 6443 df-f1o 6444 df-fv 6445 df-isom 6446 df-riota 7241 df-ov 7287 df-oprab 7288 df-mpo 7289 df-of 7542 df-om 7722 df-1st 7840 df-2nd 7841 df-supp 7987 df-frecs 8106 df-wrecs 8137 df-recs 8211 df-rdg 8250 df-1o 8306 df-2o 8307 df-er 8507 df-map 8626 df-pm 8627 df-ixp 8695 df-en 8743 df-dom 8744 df-sdom 8745 df-fin 8746 df-fsupp 9138 df-fi 9179 df-sup 9210 df-inf 9211 df-oi 9278 df-card 9706 df-pnf 11020 df-mnf 11021 df-xr 11022 df-ltxr 11023 df-le 11024 df-sub 11216 df-neg 11217 df-div 11642 df-nn 11983 df-2 12045 df-3 12046 df-4 12047 df-5 12048 df-6 12049 df-7 12050 df-8 12051 df-9 12052 df-n0 12243 df-z 12329 df-dec 12447 df-uz 12592 df-q 12698 df-rp 12740 df-xneg 12857 df-xadd 12858 df-xmul 12859 df-ioo 13092 df-ioc 13093 df-ico 13094 df-icc 13095 df-fz 13249 df-fzo 13392 df-fl 13521 df-mod 13599 df-seq 13731 df-exp 13792 df-fac 13997 df-bc 14026 df-hash 14054 df-shft 14787 df-cj 14819 df-re 14820 df-im 14821 df-sqrt 14955 df-abs 14956 df-limsup 15189 df-clim 15206 df-rlim 15207 df-sum 15407 df-ef 15786 df-sin 15788 df-cos 15789 df-pi 15791 df-struct 16857 df-sets 16874 df-slot 16892 df-ndx 16904 df-base 16922 df-ress 16951 df-plusg 16984 df-mulr 16985 df-starv 16986 df-sca 16987 df-vsca 16988 df-ip 16989 df-tset 16990 df-ple 16991 df-ds 16993 df-unif 16994 df-hom 16995 df-cco 16996 df-rest 17142 df-topn 17143 df-0g 17161 df-gsum 17162 df-topgen 17163 df-pt 17164 df-prds 17167 df-xrs 17222 df-qtop 17227 df-imas 17228 df-xps 17230 df-mre 17304 df-mrc 17305 df-acs 17307 df-mgm 18335 df-sgrp 18384 df-mnd 18395 df-submnd 18440 df-mulg 18710 df-cntz 18932 df-cmn 19397 df-psmet 20598 df-xmet 20599 df-met 20600 df-bl 20601 df-mopn 20602 df-fbas 20603 df-fg 20604 df-cnfld 20607 df-top 22052 df-topon 22069 df-topsp 22091 df-bases 22105 df-cld 22179 df-ntr 22180 df-cls 22181 df-nei 22258 df-lp 22296 df-perf 22297 df-cn 22387 df-cnp 22388 df-haus 22475 df-tx 22722 df-hmeo 22915 df-fil 23006 df-fm 23098 df-flim 23099 df-flf 23100 df-xms 23482 df-ms 23483 df-tms 23484 df-cncf 24050 df-limc 25039 df-dv 25040 df-log 25721 df-cxp 25722

This theorem is referenced by: 1cubr 26001

W3C validator