Metamath Proof Explorer


Theorem qaa

Description: Every rational number is algebraic. (Contributed by Mario Carneiro, 23-Jul-2014)

Ref Expression
Assertion qaa ⊢ A ∈ ℚ → A ∈ 𝔸

Proof

Step Hyp Ref Expression
1 qcn ⊢ A ∈ ℚ → A ∈ ℂ
2 qsscn ⊢ ℚ ⊆ ℂ
3 1z ⊢ 1 ∈ ℤ
4 zq ⊢ 1 ∈ ℤ → 1 ∈ ℚ
5 3 4 ax-mp ⊢ 1 ∈ ℚ
6 plyid ⊢ ℚ ⊆ ℂ ∧ 1 ∈ ℚ → X p ∈ Poly ⁡ ℚ
7 2 5 6 mp2an ⊢ X p ∈ Poly ⁡ ℚ
8 7 a1i ⊢ A ∈ ℚ → X p ∈ Poly ⁡ ℚ
9 plyconst ⊢ ℚ ⊆ ℂ ∧ A ∈ ℚ → ℂ × A ∈ Poly ⁡ ℚ
10 2 9 mpan ⊢ A ∈ ℚ → ℂ × A ∈ Poly ⁡ ℚ
11 qaddcl ⊢ x ∈ ℚ ∧ y ∈ ℚ → x + y ∈ ℚ
12 11 adantl ⊢ A ∈ ℚ ∧ x ∈ ℚ ∧ y ∈ ℚ → x + y ∈ ℚ
13 qmulcl ⊢ x ∈ ℚ ∧ y ∈ ℚ → x ⁢ y ∈ ℚ
14 13 adantl ⊢ A ∈ ℚ ∧ x ∈ ℚ ∧ y ∈ ℚ → x ⁢ y ∈ ℚ
15 qnegcl ⊢ 1 ∈ ℚ → − 1 ∈ ℚ
16 5 15 ax-mp ⊢ − 1 ∈ ℚ
17 16 a1i ⊢ A ∈ ℚ → − 1 ∈ ℚ
18 8 10 12 14 17 plysub ⊢ A ∈ ℚ → X p − f ℂ × A ∈ Poly ⁡ ℚ
19 peano2cn ⊢ A ∈ ℂ → A + 1 ∈ ℂ
20 1 19 syl ⊢ A ∈ ℚ → A + 1 ∈ ℂ
21 fnresi ⊢ I ↾ ℂ Fn ℂ
22 df-idp ⊢ X p = I ↾ ℂ
23 22 fneq1i ⊢ X p Fn ℂ ↔ I ↾ ℂ Fn ℂ
24 21 23 mpbir ⊢ X p Fn ℂ
25 24 a1i ⊢ A ∈ ℚ → X p Fn ℂ
26 fnconstg ⊢ A ∈ ℚ → ℂ × A Fn ℂ
27 cnex ⊢ ℂ ∈ V
28 27 a1i ⊢ A ∈ ℚ → ℂ ∈ V
29 inidm ⊢ ℂ ∩ ℂ = ℂ
30 22 fveq1i ⊢ X p ⁡ A + 1 = I ↾ ℂ ⁡ A + 1
31 fvresi ⊢ A + 1 ∈ ℂ → I ↾ ℂ ⁡ A + 1 = A + 1
32 30 31 eqtrid ⊢ A + 1 ∈ ℂ → X p ⁡ A + 1 = A + 1
33 32 adantl ⊢ A ∈ ℚ ∧ A + 1 ∈ ℂ → X p ⁡ A + 1 = A + 1
34 fvconst2g ⊢ A ∈ ℚ ∧ A + 1 ∈ ℂ → ℂ × A ⁡ A + 1 = A
35 25 26 28 28 29 33 34 ofval ⊢ A ∈ ℚ ∧ A + 1 ∈ ℂ → X p − f ℂ × A ⁡ A + 1 = A + 1 - A
36 20 35 mpdan ⊢ A ∈ ℚ → X p − f ℂ × A ⁡ A + 1 = A + 1 - A
37 ax-1cn ⊢ 1 ∈ ℂ
38 pncan2 ⊢ A ∈ ℂ ∧ 1 ∈ ℂ → A + 1 - A = 1
39 1 37 38 sylancl ⊢ A ∈ ℚ → A + 1 - A = 1
40 36 39 eqtrd ⊢ A ∈ ℚ → X p − f ℂ × A ⁡ A + 1 = 1
41 ax-1ne0 ⊢ 1 ≠ 0
42 41 a1i ⊢ A ∈ ℚ → 1 ≠ 0
43 40 42 eqnetrd ⊢ A ∈ ℚ → X p − f ℂ × A ⁡ A + 1 ≠ 0
44 ne0p ⊢ A + 1 ∈ ℂ ∧ X p − f ℂ × A ⁡ A + 1 ≠ 0 → X p − f ℂ × A ≠ 0 𝑝
45 20 43 44 syl2anc ⊢ A ∈ ℚ → X p − f ℂ × A ≠ 0 𝑝
46 eldifsn ⊢ X p − f ℂ × A ∈ Poly ⁡ ℚ ∖ 0 𝑝 ↔ X p − f ℂ × A ∈ Poly ⁡ ℚ ∧ X p − f ℂ × A ≠ 0 𝑝
47 18 45 46 sylanbrc ⊢ A ∈ ℚ → X p − f ℂ × A ∈ Poly ⁡ ℚ ∖ 0 𝑝
48 22 fveq1i ⊢ X p ⁡ A = I ↾ ℂ ⁡ A
49 fvresi ⊢ A ∈ ℂ → I ↾ ℂ ⁡ A = A
50 48 49 eqtrid ⊢ A ∈ ℂ → X p ⁡ A = A
51 50 adantl ⊢ A ∈ ℚ ∧ A ∈ ℂ → X p ⁡ A = A
52 fvconst2g ⊢ A ∈ ℚ ∧ A ∈ ℂ → ℂ × A ⁡ A = A
53 25 26 28 28 29 51 52 ofval ⊢ A ∈ ℚ ∧ A ∈ ℂ → X p − f ℂ × A ⁡ A = A − A
54 1 53 mpdan ⊢ A ∈ ℚ → X p − f ℂ × A ⁡ A = A − A
55 1 subidd ⊢ A ∈ ℚ → A − A = 0
56 54 55 eqtrd ⊢ A ∈ ℚ → X p − f ℂ × A ⁡ A = 0
57 fveq1 ⊢ f = X p − f ℂ × A → f ⁡ A = X p − f ℂ × A ⁡ A
58 57 eqeq1d ⊢ f = X p − f ℂ × A → f ⁡ A = 0 ↔ X p − f ℂ × A ⁡ A = 0
59 58 rspcev ⊢ X p − f ℂ × A ∈ Poly ⁡ ℚ ∖ 0 𝑝 ∧ X p − f ℂ × A ⁡ A = 0 → ∃ f ∈ Poly ⁡ ℚ ∖ 0 𝑝 f ⁡ A = 0
60 47 56 59 syl2anc ⊢ A ∈ ℚ → ∃ f ∈ Poly ⁡ ℚ ∖ 0 𝑝 f ⁡ A = 0
61 elqaa ⊢ A ∈ 𝔸 ↔ A ∈ ℂ ∧ ∃ f ∈ Poly ⁡ ℚ ∖ 0 𝑝 f ⁡ A = 0
62 1 60 61 sylanbrc ⊢ A ∈ ℚ → A ∈ 𝔸