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 25815

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 1190	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝑁 ∈ ℕ)
2		nnm1nn0 12204	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ₀)
3	1, 2	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ ℕ₀)
4		nn0uz 12549	. . . . . . 7 ⊢ ℕ₀ = (ℤ_≥‘0)
5	3, 4	eleqtrdi 2849	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝑁 − 1) ∈ (ℤ_≥‘0))
6		eluzfz1 13192	. . . . . 6 ⊢ ((𝑁 − 1) ∈ (ℤ_≥‘0) → 0 ∈ (0...(𝑁 − 1)))
7	5, 6	syl 17	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 0 ∈ (0...(𝑁 − 1)))
8		neg1cn 12017	. . . . . . . . . 10 ⊢ -1 ∈ ℂ
9		2re 11977	. . . . . . . . . . . 12 ⊢ 2 ∈ ℝ
10		simp2 1135	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℕ)
11		nndivre 11944	. . . . . . . . . . . 12 ⊢ ((2 ∈ ℝ ∧ 𝑁 ∈ ℕ) → (2 / 𝑁) ∈ ℝ)
12	9, 10, 11	sylancr 586	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℝ)
13	12	recnd 10934	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (2 / 𝑁) ∈ ℂ)
14		cxpcl 25734	. . . . . . . . . 10 ⊢ ((-1 ∈ ℂ ∧ (2 / 𝑁) ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
15	8, 13, 14	sylancr 586	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
16	15	adantr 480	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
17		0nn0 12178	. . . . . . . 8 ⊢ 0 ∈ ℕ₀
18		expcl 13728	. . . . . . . 8 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 0 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
19	16, 17, 18	sylancl 585	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((-1↑_𝑐(2 / 𝑁))↑0) ∈ ℂ)
20	19	mul02d 11103	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0 · ((-1↑_𝑐(2 / 𝑁))↑0)) = 0)
21		simprl 767	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = 0)
22	21	oveq1d 7270	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = (0↑𝑁))
23		simprr 769	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐴↑𝑁) = 𝐵)
24	1	0expd 13785	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑𝑁) = 0)
25	22, 23, 24	3eqtr3d 2786	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐵 = 0)
26	25	oveq1d 7270	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = (0↑_𝑐(1 / 𝑁)))
27		nncn 11911	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
28		nnne0 11937	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0)
29		reccl 11570	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ∈ ℂ)
30		recne0 11576	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (1 / 𝑁) ≠ 0)
31	29, 30	0cxpd 25770	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℂ ∧ 𝑁 ≠ 0) → (0↑_𝑐(1 / 𝑁)) = 0)
32	27, 28, 31	syl2anc 583	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → (0↑_𝑐(1 / 𝑁)) = 0)
33	1, 32	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (0↑_𝑐(1 / 𝑁)) = 0)
34	26, 33	eqtrd 2778	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → (𝐵↑_𝑐(1 / 𝑁)) = 0)
35	34	oveq1d 7270	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)) = (0 · ((-1↑_𝑐(2 / 𝑁))↑0)))
36	20, 35, 21	3eqtr4rd 2789	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
37		oveq2 7263	. . . . . . 7 ⊢ (𝑛 = 0 → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑0))
38	37	oveq2d 7271	. . . . . 6 ⊢ (𝑛 = 0 → ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0)))
39	38	rspceeqv 3567	. . . . 5 ⊢ ((0 ∈ (0...(𝑁 − 1)) ∧ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑0))) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
40	7, 36, 39	syl2anc 583	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ (𝐴 = 0 ∧ (𝐴↑𝑁) = 𝐵)) → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
41	40	expr 456	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 = 0) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
42		simpl1 1189	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ)
43		simpr 484	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0)
44		simpl2 1190	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ)
45	44	nnzd 12354	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℤ)
46		explog 25654	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
47	42, 43, 45, 46	syl3anc 1369	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) = (exp‘(𝑁 · (log‘𝐴))))
48	47	eqcomd 2744	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁))
49	10	nncnd 11919	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ∈ ℂ)
50	49	adantr 480	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℂ)
51	42, 43	logcld 25631	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘𝐴) ∈ ℂ)
52	50, 51	mulcld 10926	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝑁 · (log‘𝐴)) ∈ ℂ)
53	44	nnnn0d 12223	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ₀)
54	42, 53	expcld 13792	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ∈ ℂ)
55	42, 43, 45	expne0d 13798	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (𝐴↑𝑁) ≠ 0)
56		eflogeq 25662	. . . . . . 7 ⊢ (((𝑁 · (log‘𝐴)) ∈ ℂ ∧ (𝐴↑𝑁) ∈ ℂ ∧ (𝐴↑𝑁) ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
57	52, 54, 55, 56	syl3anc 1369	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ((exp‘(𝑁 · (log‘𝐴))) = (𝐴↑𝑁) ↔ ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
58	48, 57	mpbid 231	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → ∃𝑚 ∈ ℤ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)))
59	54, 55	logcld 25631	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (log‘(𝐴↑𝑁)) ∈ ℂ)
60	59	adantr 480	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘(𝐴↑𝑁)) ∈ ℂ)
61		ax-icn 10861	. . . . . . . . . . 11 ⊢ i ∈ ℂ
62		2cn 11978	. . . . . . . . . . . 12 ⊢ 2 ∈ ℂ
63		picn 25521	. . . . . . . . . . . 12 ⊢ π ∈ ℂ
64	62, 63	mulcli 10913	. . . . . . . . . . 11 ⊢ (2 · π) ∈ ℂ
65	61, 64	mulcli 10913	. . . . . . . . . 10 ⊢ (i · (2 · π)) ∈ ℂ
66		zcn 12254	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
67	66	adantl 481	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℂ)
68		mulcl 10886	. . . . . . . . . 10 ⊢ (((i · (2 · π)) ∈ ℂ ∧ 𝑚 ∈ ℂ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
69	65, 67, 68	sylancr 586	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) · 𝑚) ∈ ℂ)
70	60, 69	addcld 10925	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) ∈ ℂ)
71	50	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℂ)
72	51	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (log‘𝐴) ∈ ℂ)
73	10	nnne0d 11953	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝑁 ≠ 0)
74	73	ad2antrr 722	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ≠ 0)
75	70, 71, 72, 74	divmuld 11703	. . . . . . 7 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) ↔ (𝑁 · (log‘𝐴)) = ((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚))))
76		fveq2 6756	. . . . . . . 8 ⊢ ((((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (log‘𝐴) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)))
77	71, 74	reccld 11674	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1 / 𝑁) ∈ ℂ)
78	77, 60	mulcld 10926	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ)
79	13	ad2antrr 722	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (2 / 𝑁) ∈ ℂ)
80	79, 67	mulcld 10926	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 / 𝑁) · 𝑚) ∈ ℂ)
81	61, 63	mulcli 10913	. . . . . . . . . . . . 13 ⊢ (i · π) ∈ ℂ
82		mulcl 10886	. . . . . . . . . . . . 13 ⊢ ((((2 / 𝑁) · 𝑚) ∈ ℂ ∧ (i · π) ∈ ℂ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
83	80, 81, 82	sylancl 585	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ)
84		efadd 15731	. . . . . . . . . . . 12 ⊢ ((((1 / 𝑁) · (log‘(𝐴↑𝑁))) ∈ ℂ ∧ (((2 / 𝑁) · 𝑚) · (i · π)) ∈ ℂ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
85	78, 83, 84	syl2anc 583	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π)))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
86	60, 69, 71, 74	divdird 11719	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)))
87	60, 71, 74	divrec2d 11685	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((log‘(𝐴↑𝑁)) / 𝑁) = ((1 / 𝑁) · (log‘(𝐴↑𝑁))))
88	65	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (i · (2 · π)) ∈ ℂ)
89	88, 67, 71, 74	div23d 11718	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((i · (2 · π)) / 𝑁) · 𝑚))
90	61, 62, 63	mul12i 11100	. . . . . . . . . . . . . . . . . 18 ⊢ (i · (2 · π)) = (2 · (i · π))
91	90	oveq1i 7265	. . . . . . . . . . . . . . . . 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 11718	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((2 · (i · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
95	91, 94	syl5eq 2791	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((i · (2 · π)) / 𝑁) = ((2 / 𝑁) · (i · π)))
96	95	oveq1d 7270	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) / 𝑁) · 𝑚) = (((2 / 𝑁) · (i · π)) · 𝑚))
97	79, 93, 67	mul32d 11115	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((2 / 𝑁) · (i · π)) · 𝑚) = (((2 / 𝑁) · 𝑚) · (i · π)))
98	89, 96, 97	3eqtrd 2782	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((i · (2 · π)) · 𝑚) / 𝑁) = (((2 / 𝑁) · 𝑚) · (i · π)))
99	87, 98	oveq12d 7273	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) / 𝑁) + (((i · (2 · π)) · 𝑚) / 𝑁)) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
100	86, 99	eqtrd 2778	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁) = (((1 / 𝑁) · (log‘(𝐴↑𝑁))) + (((2 / 𝑁) · 𝑚) · (i · π))))
101	100	fveq2d 6760	. . . . . . . . . . 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 25772	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))))
105	8	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ∈ ℂ)
106		neg1ne0 12019	. . . . . . . . . . . . . . 15 ⊢ -1 ≠ 0
107	106	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → -1 ≠ 0)
108		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
109	105, 107, 79, 108	cxpmul2zd 25776	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = ((-1↑_𝑐(2 / 𝑁))↑𝑚))
110	105, 107, 80	cxpefd 25772	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))))
111		logm1 25649	. . . . . . . . . . . . . . . 16 ⊢ (log‘-1) = (i · π)
112	111	oveq2i 7266	. . . . . . . . . . . . . . 15 ⊢ (((2 / 𝑁) · 𝑚) · (log‘-1)) = (((2 / 𝑁) · 𝑚) · (i · π))
113	112	fveq2i 6759	. . . . . . . . . . . . . 14 ⊢ (exp‘(((2 / 𝑁) · 𝑚) · (log‘-1))) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))
114	110, 113	eqtrdi 2795	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐((2 / 𝑁) · 𝑚)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
115	105, 79	cxpcld 25768	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
116	8	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ∈ ℂ)
117	106	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → -1 ≠ 0)
118	116, 117, 13	cxpne0d 25773	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
119	118	ad2antrr 722	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (-1↑_𝑐(2 / 𝑁)) ≠ 0)
120	115, 119, 108	expclzd 13797	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) ∈ ℂ)
121	44	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ)
122	108, 121	zmodcld 13540	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℕ₀)
123	115, 122	expcld 13792	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ∈ ℂ)
124	122	nn0zd 12353	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℤ)
125	115, 119, 124	expne0d 13798	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) ≠ 0)
126	115, 119, 124, 108	expsubd 13803	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
127	121	nnzd 12354	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℤ)
128		zre 12253	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℝ)
129	121	nnrpd 12699	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℝ⁺)
130		moddifz 13531	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ ℝ ∧ 𝑁 ∈ ℝ⁺) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
131	128, 129, 130	syl2an2 682	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)
132		expmulz 13757	. . . . . . . . . . . . . . . . 17 ⊢ ((((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ (-1↑_𝑐(2 / 𝑁)) ≠ 0) ∧ (𝑁 ∈ ℤ ∧ ((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ)) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
133	115, 119, 127, 131, 132	syl22anc 835	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
134	122	nn0cnd 12225	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ ℂ)
135	67, 134	subcld 11262	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 − (𝑚 mod 𝑁)) ∈ ℂ)
136	135, 71, 74	divcan2d 11683	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (𝑚 − (𝑚 mod 𝑁)))
137	136	oveq2d 7271	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · ((𝑚 − (𝑚 mod 𝑁)) / 𝑁))) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))))
138		root1id 25812	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ ℕ → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
139	121, 138	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
140	139	oveq1d 7270	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)))
141		1exp 13740	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑚 − (𝑚 mod 𝑁)) / 𝑁) ∈ ℤ → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
142	131, 141	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (1↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
143	140, 142	eqtrd 2778	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑((𝑚 − (𝑚 mod 𝑁)) / 𝑁)) = 1)
144	133, 137, 143	3eqtr3d 2786	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 − (𝑚 mod 𝑁))) = 1)
145	126, 144	eqtr3d 2780	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((-1↑_𝑐(2 / 𝑁))↑𝑚) / ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 1)
146	120, 123, 125, 145	diveq1d 11689	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑𝑚) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
147	109, 114, 146	3eqtr3rd 2787	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)) = (exp‘(((2 / 𝑁) · 𝑚) · (i · π))))
148	104, 147	oveq12d 7273	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = ((exp‘((1 / 𝑁) · (log‘(𝐴↑𝑁)))) · (exp‘(((2 / 𝑁) · 𝑚) · (i · π)))))
149	85, 101, 148	3eqtr4d 2788	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
150		eflog 25637	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
151	42, 43, 150	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) → (exp‘(log‘𝐴)) = 𝐴)
152	151	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (exp‘(log‘𝐴)) = 𝐴)
153	149, 152	eqeq12d 2754	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → ((exp‘(((log‘(𝐴↑𝑁)) + ((i · (2 · π)) · 𝑚)) / 𝑁)) = (exp‘(log‘𝐴)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
154		zmodfz 13541	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
155	108, 121, 154	syl2anc 583	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝐴 ≠ 0) ∧ 𝑚 ∈ ℤ) → (𝑚 mod 𝑁) ∈ (0...(𝑁 − 1)))
156		eqcom 2745	. . . . . . . . . . . . 13 ⊢ (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴)
157		oveq2 7263	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) = ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁)))
158	157	oveq2d 7271	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑚 mod 𝑁) → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))))
159	158	eqeq1d 2740	. . . . . . . . . . . . 13 ⊢ (𝑛 = (𝑚 mod 𝑁) → ((((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = 𝐴 ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
160	156, 159	syl5bb 282	. . . . . . . . . . . 12 ⊢ (𝑛 = (𝑚 mod 𝑁) → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑(𝑚 mod 𝑁))) = 𝐴))
161	160	rspcev 3552	. . . . . . . . . . 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 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 3212	. . . . 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 7262	. . . . . . 7 ⊢ ((𝐴↑𝑁) = 𝐵 → ((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) = (𝐵↑_𝑐(1 / 𝑁)))
170	169	oveq1d 7270	. . . . . 6 ⊢ ((𝐴↑𝑁) = 𝐵 → (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)))
171	170	eqeq2d 2749	. . . . 5 ⊢ ((𝐴↑𝑁) = 𝐵 → (𝐴 = (((𝐴↑𝑁)↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) ↔ 𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
172	171	rexbidv 3225	. . . 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 3031	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → ((𝐴↑𝑁) = 𝐵 → ∃𝑛 ∈ (0...(𝑁 − 1))𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))))
175		simp3 1136	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
176		nnrecre 11945	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → (1 / 𝑁) ∈ ℝ)
177	176	3ad2ant2 1132	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℝ)
178	177	recnd 10934	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (1 / 𝑁) ∈ ℂ)
179	175, 178	cxpcld 25768	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
180	179	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵↑_𝑐(1 / 𝑁)) ∈ ℂ)
181		elfznn0 13278	. . . . . . 7 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℕ₀)
182		expcl 13728	. . . . . . 7 ⊢ (((-1↑_𝑐(2 / 𝑁)) ∈ ℂ ∧ 𝑛 ∈ ℕ₀) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
183	15, 181, 182	syl2an 595	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑛) ∈ ℂ)
184	10	adantr 480	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ)
185	184	nnnn0d 12223	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℕ₀)
186	180, 183, 185	mulexpd 13807	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)))
187	175	adantr 480	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝐵 ∈ ℂ)
188		cxproot 25750	. . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
189	187, 184, 188	syl2anc 583	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((𝐵↑_𝑐(1 / 𝑁))↑𝑁) = 𝐵)
190	181	adantl 481	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℕ₀)
191	190	nn0cnd 12225	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℂ)
192	184	nncnd 11919	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑁 ∈ ℂ)
193	191, 192	mulcomd 10927	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝑛 · 𝑁) = (𝑁 · 𝑛))
194	193	oveq2d 7271	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)))
195	15	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (-1↑_𝑐(2 / 𝑁)) ∈ ℂ)
196	195, 185, 190	expmuld 13795	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑛 · 𝑁)) = (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁))
197	195, 190, 185	expmuld 13795	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑(𝑁 · 𝑛)) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
198	194, 196, 197	3eqtr3d 2786	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛))
199	184, 138	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → ((-1↑_𝑐(2 / 𝑁))↑𝑁) = 1)
200	199	oveq1d 7270	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑁)↑𝑛) = (1↑𝑛))
201		elfzelz 13185	. . . . . . . . 9 ⊢ (𝑛 ∈ (0...(𝑁 − 1)) → 𝑛 ∈ ℤ)
202	201	adantl 481	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → 𝑛 ∈ ℤ)
203		1exp 13740	. . . . . . . 8 ⊢ (𝑛 ∈ ℤ → (1↑𝑛) = 1)
204	202, 203	syl 17	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (1↑𝑛) = 1)
205	198, 200, 204	3eqtrd 2782	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁) = 1)
206	189, 205	oveq12d 7273	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁))↑𝑁) · (((-1↑_𝑐(2 / 𝑁))↑𝑛)↑𝑁)) = (𝐵 · 1))
207	187	mulid1d 10923	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐵 · 1) = 𝐵)
208	186, 206, 207	3eqtrd 2782	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵)
209		oveq1 7262	. . . . 5 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁))
210	209	eqeq1d 2740	. . . 4 ⊢ (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → ((𝐴↑𝑁) = 𝐵 ↔ (((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛))↑𝑁) = 𝐵))
211	208, 210	syl5ibrcom 246	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝐵 ∈ ℂ) ∧ 𝑛 ∈ (0...(𝑁 − 1))) → (𝐴 = ((𝐵↑_𝑐(1 / 𝑁)) · ((-1↑_𝑐(2 / 𝑁))↑𝑛)) → (𝐴↑𝑁) = 𝐵))
212	211	rexlimdva 3212	. 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 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∃wrex 3064 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 ici 10804 + caddc 10805 · cmul 10807 − cmin 11135 -cneg 11136 / cdiv 11562 ℕcn 11903 2c2 11958 ℕ₀cn0 12163 ℤcz 12249 ℤ_≥cuz 12511 ℝ⁺crp 12659 ...cfz 13168 mod cmo 13517 ↑cexp 13710 expce 15699 πcpi 15704 logclog 25615 ↑_𝑐ccxp 25616

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-pm 8576 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-fi 9100 df-sup 9131 df-inf 9132 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-ioo 13012 df-ioc 13013 df-ico 13014 df-icc 13015 df-fz 13169 df-fzo 13312 df-fl 13440 df-mod 13518 df-seq 13650 df-exp 13711 df-fac 13916 df-bc 13945 df-hash 13973 df-shft 14706 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-limsup 15108 df-clim 15125 df-rlim 15126 df-sum 15326 df-ef 15705 df-sin 15707 df-cos 15708 df-pi 15710 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-sca 16904 df-vsca 16905 df-ip 16906 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-hom 16912 df-cco 16913 df-rest 17050 df-topn 17051 df-0g 17069 df-gsum 17070 df-topgen 17071 df-pt 17072 df-prds 17075 df-xrs 17130 df-qtop 17135 df-imas 17136 df-xps 17138 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-mulg 18616 df-cntz 18838 df-cmn 19303 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-fbas 20507 df-fg 20508 df-cnfld 20511 df-top 21951 df-topon 21968 df-topsp 21990 df-bases 22004 df-cld 22078 df-ntr 22079 df-cls 22080 df-nei 22157 df-lp 22195 df-perf 22196 df-cn 22286 df-cnp 22287 df-haus 22374 df-tx 22621 df-hmeo 22814 df-fil 22905 df-fm 22997 df-flim 22998 df-flf 22999 df-xms 23381 df-ms 23382 df-tms 23383 df-cncf 23947 df-limc 24935 df-dv 24936 df-log 25617 df-cxp 25618

This theorem is referenced by: 1cubr 25897

W3C validator