Metamath Proof Explorer


Theorem constrcon

Description: Contradiction of constructibility: If a complex number A has minimal polynomial F over QQ of a degree that is not a power of 2 , then A is not constructible. (Contributed by Thierry Arnoux, 26-Oct-2025)

Ref Expression
Hypotheses constrcon.d ⊢ D = deg 1 ⁡ ℂ fld ↾ 𝑠 ℚ
constrcon.m ⊢ M = ℂ fld minPoly ℚ
constrcon.a ⊢ φ → A ∈ ℂ
constrcon.f ⊢ φ → F = M ⁡ A
constrcon.1 ⊢ φ → D ⁡ F ∈ ℕ 0
constrcon.2 ⊢ φ ∧ n ∈ ℕ 0 → D ⁡ F ≠ 2 n
Assertion constrcon ⊢ φ → ¬ A ∈ Constr

Proof

Step Hyp Ref Expression
1 constrcon.d ⊢ D = deg 1 ⁡ ℂ fld ↾ 𝑠 ℚ
2 constrcon.m ⊢ M = ℂ fld minPoly ℚ
3 constrcon.a ⊢ φ → A ∈ ℂ
4 constrcon.f ⊢ φ → F = M ⁡ A
5 constrcon.1 ⊢ φ → D ⁡ F ∈ ℕ 0
6 constrcon.2 ⊢ φ ∧ n ∈ ℕ 0 → D ⁡ F ≠ 2 n
7 6 neneqd ⊢ φ ∧ n ∈ ℕ 0 → ¬ D ⁡ F = 2 n
8 eqid ⊢ ℂ fld ↾ 𝑠 ℚ = ℂ fld ↾ 𝑠 ℚ
9 eqid ⊢ ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A = ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A
10 eqid ⊢ deg 1 ⁡ ℂ fld = deg 1 ⁡ ℂ fld
11 cnfldfld ⊢ ℂ fld ∈ Field
12 11 a1i ⊢ φ → ℂ fld ∈ Field
13 cndrng ⊢ ℂ fld ∈ DivRing
14 qsubdrg ⊢ ℚ ∈ SubRing ⁡ ℂ fld ∧ ℂ fld ↾ 𝑠 ℚ ∈ DivRing
15 14 simpli ⊢ ℚ ∈ SubRing ⁡ ℂ fld
16 8 qdrng ⊢ ℂ fld ↾ 𝑠 ℚ ∈ DivRing
17 issdrg ⊢ ℚ ∈ SubDRing ⁡ ℂ fld ↔ ℂ fld ∈ DivRing ∧ ℚ ∈ SubRing ⁡ ℂ fld ∧ ℂ fld ↾ 𝑠 ℚ ∈ DivRing
18 13 15 16 17 mpbir3an ⊢ ℚ ∈ SubDRing ⁡ ℂ fld
19 18 a1i ⊢ φ → ℚ ∈ SubDRing ⁡ ℂ fld
20 cnfldbas ⊢ ℂ = Base ℂ fld
21 eqidd ⊢ φ → D = D
22 21 4 fveq12d ⊢ φ → D ⁡ F = D ⁡ M ⁡ A
23 22 5 eqeltrrd ⊢ φ → D ⁡ M ⁡ A ∈ ℕ 0
24 20 2 1 12 19 3 23 minplyelirng ⊢ φ → A ∈ ℂ fld IntgRing ℚ
25 8 9 10 2 12 19 24 algextdeg ⊢ φ → ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = deg 1 ⁡ ℂ fld ⁡ M ⁡ A
26 eqid ⊢ Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ = Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ
27 eqid ⊢ Base Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ = Base Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ
28 eqid ⊢ ℂ fld evalSub 1 ℚ = ℂ fld evalSub 1 ℚ
29 eqid ⊢ 0 ℂ fld = 0 ℂ fld
30 eqid ⊢ q ∈ dom ⁡ ℂ fld evalSub 1 ℚ | ℂ fld evalSub 1 ℚ ⁡ q ⁡ A = 0 ℂ fld = q ∈ dom ⁡ ℂ fld evalSub 1 ℚ | ℂ fld evalSub 1 ℚ ⁡ q ⁡ A = 0 ℂ fld
31 eqid ⊢ RSpan ⁡ Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ = RSpan ⁡ Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ
32 eqid ⊢ idlGen 1p ⁡ ℂ fld ↾ 𝑠 ℚ = idlGen 1p ⁡ ℂ fld ↾ 𝑠 ℚ
33 28 26 20 12 19 3 29 30 31 32 2 minplycl ⊢ φ → M ⁡ A ∈ Base Poly 1 ⁡ ℂ fld ↾ 𝑠 ℚ
34 15 a1i ⊢ φ → ℚ ∈ SubRing ⁡ ℂ fld
35 8 10 26 27 33 34 ressdeg1 ⊢ φ → deg 1 ⁡ ℂ fld ⁡ M ⁡ A = deg 1 ⁡ ℂ fld ↾ 𝑠 ℚ ⁡ M ⁡ A
36 1 21 eqtr3id ⊢ φ → deg 1 ⁡ ℂ fld ↾ 𝑠 ℚ = D
37 4 eqcomd ⊢ φ → M ⁡ A = F
38 36 37 fveq12d ⊢ φ → deg 1 ⁡ ℂ fld ↾ 𝑠 ℚ ⁡ M ⁡ A = D ⁡ F
39 25 35 38 3eqtrd ⊢ φ → ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = D ⁡ F
40 39 eqeq1d ⊢ φ → ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = 2 n ↔ D ⁡ F = 2 n
41 40 adantr ⊢ φ ∧ n ∈ ℕ 0 → ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = 2 n ↔ D ⁡ F = 2 n
42 7 41 mtbird ⊢ φ ∧ n ∈ ℕ 0 → ¬ ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = 2 n
43 42 nrexdv ⊢ φ → ¬ ∃ n ∈ ℕ 0 ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = 2 n
44 eqid ⊢ ℂ fld fldGen ℚ ∪ A = ℂ fld fldGen ℚ ∪ A
45 simpr ⊢ φ ∧ A ∈ Constr → A ∈ Constr
46 8 9 44 45 constrext2chn ⊢ φ ∧ A ∈ Constr → ∃ n ∈ ℕ 0 ℂ fld ↾ 𝑠 ℂ fld fldGen ℚ ∪ A .:. ℂ fld ↾ 𝑠 ℚ = 2 n
47 43 46 mtand ⊢ φ → ¬ A ∈ Constr