Metamath Proof Explorer


Theorem bruval2

Description: An alternate way to express the basic N -th root of unity, see cxpeq . (Contributed by AV, 24-Oct-2026)

Ref Expression
Assertion bruval2 Could not format assertion : No typesetting found for |- ( N e. NN -> ( bRoU ` N ) = ( -u 1 ^c ( 2 / N ) ) ) with typecode |-

Proof

Step Hyp Ref Expression
1 2cn ⊢ 2 ∈ ℂ
2 1 a1i ⊢ N ∈ ℕ → 2 ∈ ℂ
3 picn ⊢ π ∈ ℂ
4 ax-icn ⊢ i ∈ ℂ
5 3 4 mulcli ⊢ π ⁢ i ∈ ℂ
6 5 a1i ⊢ N ∈ ℕ → π ⁢ i ∈ ℂ
7 nncn ⊢ N ∈ ℕ → N ∈ ℂ
8 nnne0 ⊢ N ∈ ℕ → N ≠ 0
9 2 6 7 8 div23d ⊢ N ∈ ℕ → 2 ⁢ π ⁢ i N = 2 N ⁢ π ⁢ i
10 logm1 ⊢ log ⁡ -1 = i ⁢ π
11 4 3 mulcomi ⊢ i ⁢ π = π ⁢ i
12 10 11 eqtr2i ⊢ π ⁢ i = log ⁡ -1
13 12 a1i ⊢ N ∈ ℕ → π ⁢ i = log ⁡ -1
14 13 oveq2d ⊢ N ∈ ℕ → 2 N ⁢ π ⁢ i = 2 N ⁢ log ⁡ -1
15 9 14 eqtrd ⊢ N ∈ ℕ → 2 ⁢ π ⁢ i N = 2 N ⁢ log ⁡ -1
16 15 fveq2d ⊢ N ∈ ℕ → e 2 ⁢ π ⁢ i N = e 2 N ⁢ log ⁡ -1
17 bruval Could not format ( N e. NN -> ( bRoU ` N ) = ( exp ` ( ( 2 x. ( _pi x. _i ) ) / N ) ) ) : No typesetting found for |- ( N e. NN -> ( bRoU ` N ) = ( exp ` ( ( 2 x. ( _pi x. _i ) ) / N ) ) ) with typecode |-
18 neg1cn ⊢ − 1 ∈ ℂ
19 18 a1i ⊢ N ∈ ℕ → − 1 ∈ ℂ
20 neg1ne0 ⊢ − 1 ≠ 0
21 20 a1i ⊢ N ∈ ℕ → − 1 ≠ 0
22 2 7 8 divcld ⊢ N ∈ ℕ → 2 N ∈ ℂ
23 19 21 22 cxpefd ⊢ N ∈ ℕ → − 1 2 N = e 2 N ⁢ log ⁡ -1
24 16 17 23 3eqtr4d Could not format ( N e. NN -> ( bRoU ` N ) = ( -u 1 ^c ( 2 / N ) ) ) : No typesetting found for |- ( N e. NN -> ( bRoU ` N ) = ( -u 1 ^c ( 2 / N ) ) ) with typecode |-