Theorem aaitgo 39782

Description: The standard algebraic numbers 𝔸 are generated by IntgOver. (Contributed by Stefan O'Rear, 27-Nov-2014.)

Assertion

Ref	Expression
aaitgo	⊢ 𝔸 = (IntgOver‘ℚ)

Proof of Theorem aaitgo

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rabid 3378	. . 3 ⊢ (𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
2		qsscn 12360	. . . . 5 ⊢ ℚ ⊆ ℂ
3		itgoval 39781	. . . . 5 ⊢ (ℚ ⊆ ℂ → (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
4	2, 3	ax-mp 5	. . . 4 ⊢ (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}
5	4	eleq2i 2904	. . 3 ⊢ (𝑎 ∈ (IntgOver‘ℚ) ↔ 𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
6		aacn 24906	. . . . 5 ⊢ (𝑎 ∈ 𝔸 → 𝑎 ∈ ℂ)
7		mpaacl 39773	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → (minPolyAA‘𝑎) ∈ (Poly‘ℚ))
8		mpaaroot 39775	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((minPolyAA‘𝑎)‘𝑎) = 0)
9		mpaadgr 39774	. . . . . . . 8 ⊢ (𝑎 ∈ 𝔸 → (deg‘(minPolyAA‘𝑎)) = (degAA‘𝑎))
10	9	fveq2d 6674	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)))
11		mpaamn 39776	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)) = 1)
12	10, 11	eqtrd 2856	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)
13		fveq1 6669	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → (𝑏‘𝑎) = ((minPolyAA‘𝑎)‘𝑎))
14	13	eqeq1d 2823	. . . . . . . 8 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((𝑏‘𝑎) = 0 ↔ ((minPolyAA‘𝑎)‘𝑎) = 0))
15		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (coeff‘𝑏) = (coeff‘(minPolyAA‘𝑎)))
16		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (deg‘𝑏) = (deg‘(minPolyAA‘𝑎)))
17	15, 16	fveq12d 6677	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))))
18	17	eqeq1d 2823	. . . . . . . 8 ⊢ (𝑏 = (minPolyAA‘𝑎) → (((coeff‘𝑏)‘(deg‘𝑏)) = 1 ↔ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1))
19	14, 18	anbi12d 632	. . . . . . 7 ⊢ (𝑏 = (minPolyAA‘𝑎) → (((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) ↔ (((minPolyAA‘𝑎)‘𝑎) = 0 ∧ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)))
20	19	rspcev 3623	. . . . . 6 ⊢ (((minPolyAA‘𝑎) ∈ (Poly‘ℚ) ∧ (((minPolyAA‘𝑎)‘𝑎) = 0 ∧ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)) → ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))
21	7, 8, 12, 20	syl12anc 834	. . . . 5 ⊢ (𝑎 ∈ 𝔸 → ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))
22	6, 21	jca 514	. . . 4 ⊢ (𝑎 ∈ 𝔸 → (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
23		simpl 485	. . . . . . . . 9 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ∈ (Poly‘ℚ))
24		coe0 24846	. . . . . . . . . . . . . . 15 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
25	24	fveq1i 6671	. . . . . . . . . . . . . 14 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = ((ℕ0 × {0})‘(deg‘0𝑝))
26		dgr0 24852	. . . . . . . . . . . . . . . 16 ⊢ (deg‘0𝑝) = 0
27		0nn0 11913	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℕ0
28	26, 27	eqeltri 2909	. . . . . . . . . . . . . . 15 ⊢ (deg‘0𝑝) ∈ ℕ0
29		c0ex 10635	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ V
30	29	fvconst2 6966	. . . . . . . . . . . . . . 15 ⊢ ((deg‘0𝑝) ∈ ℕ0 → ((ℕ0 × {0})‘(deg‘0𝑝)) = 0)
31	28, 30	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((ℕ0 × {0})‘(deg‘0𝑝)) = 0
32	25, 31	eqtri 2844	. . . . . . . . . . . . 13 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = 0
33		0ne1 11709	. . . . . . . . . . . . 13 ⊢ 0 ≠ 1
34	32, 33	eqnetri 3086	. . . . . . . . . . . 12 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1
35		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (coeff‘𝑏) = (coeff‘0𝑝))
36		fveq2 6670	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (deg‘𝑏) = (deg‘0𝑝))
37	35, 36	fveq12d 6677	. . . . . . . . . . . . 13 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘0𝑝)‘(deg‘0𝑝)))
38	37	neeq1d 3075	. . . . . . . . . . . 12 ⊢ (𝑏 = 0𝑝 → (((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1 ↔ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1))
39	34, 38	mpbiri 260	. . . . . . . . . . 11 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1)
40	39	necon2i 3050	. . . . . . . . . 10 ⊢ (((coeff‘𝑏)‘(deg‘𝑏)) = 1 → 𝑏 ≠ 0𝑝)
41	40	ad2antll 727	. . . . . . . . 9 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ≠ 0𝑝)
42		eldifsn 4719	. . . . . . . . 9 ⊢ (𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}) ↔ (𝑏 ∈ (Poly‘ℚ) ∧ 𝑏 ≠ 0𝑝))
43	23, 41, 42	sylanbrc 585	. . . . . . . 8 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}))
44		simprl 769	. . . . . . . 8 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑏‘𝑎) = 0)
45	43, 44	jca 514	. . . . . . 7 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}) ∧ (𝑏‘𝑎) = 0))
46	45	reximi2 3244	. . . . . 6 ⊢ (∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0)
47	46	anim2i 618	. . . . 5 ⊢ ((𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0))
48		elqaa 24911	. . . . 5 ⊢ (𝑎 ∈ 𝔸 ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0))
49	47, 48	sylibr 236	. . . 4 ⊢ ((𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑎 ∈ 𝔸)
50	22, 49	impbii 211	. . 3 ⊢ (𝑎 ∈ 𝔸 ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
51	1, 5, 50	3bitr4ri 306	. 2 ⊢ (𝑎 ∈ 𝔸 ↔ 𝑎 ∈ (IntgOver‘ℚ))
52	51	eqriv 2818	1 ⊢ 𝔸 = (IntgOver‘ℚ)

Syntax hints:   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ≠ wne 3016  ∃wrex 3139  {crab 3142   ∖ cdif 3933   ⊆ wss 3936  {csn 4567   × cxp 5553  ‘cfv 6355  ℂcc 10535  0cc0 10537  1c1 10538  ℕ₀cn0 11898  ℚcq 12349  0_𝑝c0p 24270  Polycply 24774  coeffccoe 24776  degcdgr 24777  𝔸caa 24903  deg_AAcdgraa 39760  minPolyAAcmpaa 39761  IntgOvercitgo 39777

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-inf2 9104  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614  ax-pre-sup 10615  ax-addf 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-of 7409  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-map 8408  df-pm 8409  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-sup 8906  df-inf 8907  df-oi 8974  df-card 9368  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-div 11298  df-nn 11639  df-2 11701  df-3 11702  df-n0 11899  df-z 11983  df-uz 12245  df-q 12350  df-rp 12391  df-fz 12894  df-fzo 13035  df-fl 13163  df-mod 13239  df-seq 13371  df-exp 13431  df-hash 13692  df-cj 14458  df-re 14459  df-im 14460  df-sqrt 14594  df-abs 14595  df-clim 14845  df-rlim 14846  df-sum 15043  df-0p 24271  df-ply 24778  df-coe 24780  df-dgr 24781  df-aa 24904  df-dgraa 39762  df-mpaa 39763  df-itgo 39779

This theorem is referenced by: (None)