Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  elqaa Structured version   Visualization version   GIF version

Theorem elqaa 23881
 Description: The set of numbers generated by the roots of polynomials in the rational numbers is the same as the set of algebraic numbers, which by elaa 23875 are defined only in terms of polynomials over the integers. (Contributed by Mario Carneiro, 23-Jul-2014.) (Proof shortened by AV, 3-Oct-2020.)
Assertion
Ref Expression
elqaa (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0))
Distinct variable group:   𝐴,𝑓

Proof of Theorem elqaa
Dummy variables 𝑘 𝑚 𝑛 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elaa 23875 . . 3 (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0))
2 zssq 11671 . . . . . 6 ℤ ⊆ ℚ
3 qsscn 11675 . . . . . 6 ℚ ⊆ ℂ
4 plyss 23759 . . . . . 6 ((ℤ ⊆ ℚ ∧ ℚ ⊆ ℂ) → (Poly‘ℤ) ⊆ (Poly‘ℚ))
52, 3, 4mp2an 704 . . . . 5 (Poly‘ℤ) ⊆ (Poly‘ℚ)
6 ssdif 3707 . . . . 5 ((Poly‘ℤ) ⊆ (Poly‘ℚ) → ((Poly‘ℤ) ∖ {0𝑝}) ⊆ ((Poly‘ℚ) ∖ {0𝑝}))
7 ssrexv 3630 . . . . 5 (((Poly‘ℤ) ∖ {0𝑝}) ⊆ ((Poly‘ℚ) ∖ {0𝑝}) → (∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0 → ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0))
85, 6, 7mp2b 10 . . . 4 (∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0 → ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0)
98anim2i 591 . . 3 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℤ) ∖ {0𝑝})(𝑓𝐴) = 0) → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0))
101, 9sylbi 206 . 2 (𝐴 ∈ 𝔸 → (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0))
11 simpll 786 . . . 4 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})) ∧ (𝑓𝐴) = 0) → 𝐴 ∈ ℂ)
12 simplr 788 . . . 4 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})) ∧ (𝑓𝐴) = 0) → 𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝}))
13 simpr 476 . . . 4 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})) ∧ (𝑓𝐴) = 0) → (𝑓𝐴) = 0)
14 eqid 2610 . . . 4 (coeff‘𝑓) = (coeff‘𝑓)
15 fveq2 6103 . . . . . . . . . 10 (𝑚 = 𝑘 → ((coeff‘𝑓)‘𝑚) = ((coeff‘𝑓)‘𝑘))
1615oveq1d 6564 . . . . . . . . 9 (𝑚 = 𝑘 → (((coeff‘𝑓)‘𝑚) · 𝑗) = (((coeff‘𝑓)‘𝑘) · 𝑗))
1716eleq1d 2672 . . . . . . . 8 (𝑚 = 𝑘 → ((((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ ↔ (((coeff‘𝑓)‘𝑘) · 𝑗) ∈ ℤ))
1817rabbidv 3164 . . . . . . 7 (𝑚 = 𝑘 → {𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ} = {𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑗) ∈ ℤ})
19 oveq2 6557 . . . . . . . . 9 (𝑗 = 𝑛 → (((coeff‘𝑓)‘𝑘) · 𝑗) = (((coeff‘𝑓)‘𝑘) · 𝑛))
2019eleq1d 2672 . . . . . . . 8 (𝑗 = 𝑛 → ((((coeff‘𝑓)‘𝑘) · 𝑗) ∈ ℤ ↔ (((coeff‘𝑓)‘𝑘) · 𝑛) ∈ ℤ))
2120cbvrabv 3172 . . . . . . 7 {𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑗) ∈ ℤ} = {𝑛 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑛) ∈ ℤ}
2218, 21syl6eq 2660 . . . . . 6 (𝑚 = 𝑘 → {𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ} = {𝑛 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑛) ∈ ℤ})
2322infeq1d 8266 . . . . 5 (𝑚 = 𝑘 → inf({𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑛) ∈ ℤ}, ℝ, < ))
2423cbvmptv 4678 . . . 4 (𝑚 ∈ ℕ0 ↦ inf({𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ}, ℝ, < )) = (𝑘 ∈ ℕ0 ↦ inf({𝑛 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑘) · 𝑛) ∈ ℤ}, ℝ, < ))
25 eqid 2610 . . . 4 (seq0( · , (𝑚 ∈ ℕ0 ↦ inf({𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ}, ℝ, < )))‘(deg‘𝑓)) = (seq0( · , (𝑚 ∈ ℕ0 ↦ inf({𝑗 ∈ ℕ ∣ (((coeff‘𝑓)‘𝑚) · 𝑗) ∈ ℤ}, ℝ, < )))‘(deg‘𝑓))
2611, 12, 13, 14, 24, 25elqaalem3 23880 . . 3 (((𝐴 ∈ ℂ ∧ 𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})) ∧ (𝑓𝐴) = 0) → 𝐴 ∈ 𝔸)
2726r19.29an 3059 . 2 ((𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0) → 𝐴 ∈ 𝔸)
2810, 27impbii 198 1 (𝐴 ∈ 𝔸 ↔ (𝐴 ∈ ℂ ∧ ∃𝑓 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑓𝐴) = 0))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∃wrex 2897  {crab 2900   ∖ cdif 3537   ⊆ wss 3540  {csn 4125   ↦ cmpt 4643  ‘cfv 5804  (class class class)co 6549  infcinf 8230  ℂcc 9813  ℝcr 9814  0cc0 9815   · cmul 9820   < clt 9953  ℕcn 10897  ℕ0cn0 11169  ℤcz 11254  ℚcq 11664  seqcseq 12663  0𝑝c0p 23242  Polycply 23744  coeffccoe 23746  degcdgr 23747  𝔸caa 23873 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893  ax-addf 9894 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-oi 8298  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-q 11665  df-rp 11709  df-fz 12198  df-fzo 12335  df-fl 12455  df-mod 12531  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-rlim 14068  df-sum 14265  df-0p 23243  df-ply 23748  df-coe 23750  df-dgr 23751  df-aa 23874 This theorem is referenced by:  qaa  23882  dgraalem  36734  dgraaub  36737  aaitgo  36751  aacllem  42356
 Copyright terms: Public domain W3C validator