Theorem aaitgo 44304

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 3435	. . 3 ⊢ (𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
2		qsscn 13097	. . . . 5 ⊢ ℚ ⊆ ℂ
3		itgoval 44303	. . . . 5 ⊢ (ℚ ⊆ ℂ → (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
4	2, 3	ax-mp 5	. . . 4 ⊢ (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}
5	4	eleq2i 2855	. . 3 ⊢ (𝑎 ∈ (IntgOver‘ℚ) ↔ 𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
6		aacn 26652	. . . . 5 ⊢ (𝑎 ∈ 𝔸 → 𝑎 ∈ ℂ)
7		mpaacl 44295	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → (minPolyAA‘𝑎) ∈ (Poly‘ℚ))
8		mpaaroot 44297	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((minPolyAA‘𝑎)‘𝑎) = 0)
9		mpaadgr 44296	. . . . . . . 8 ⊢ (𝑎 ∈ 𝔸 → (deg‘(minPolyAA‘𝑎)) = (degAA‘𝑎))
10	9	fveq2d 6897	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)))
11		mpaamn 44298	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)) = 1)
12	10, 11	eqtrd 2798	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)
13		fveq1 6892	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → (𝑏‘𝑎) = ((minPolyAA‘𝑎)‘𝑎))
14	13	eqeq1d 2765	. . . . . . . 8 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((𝑏‘𝑎) = 0 ↔ ((minPolyAA‘𝑎)‘𝑎) = 0))
15		fveq2 6893	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (coeff‘𝑏) = (coeff‘(minPolyAA‘𝑎)))
16		fveq2 6893	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (deg‘𝑏) = (deg‘(minPolyAA‘𝑎)))
17	15, 16	fveq12d 6900	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))))
18	17	eqeq1d 2765	. . . . . . . 8 ⊢ (𝑏 = (minPolyAA‘𝑎) → (((coeff‘𝑏)‘(deg‘𝑏)) = 1 ↔ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1))
19	14, 18	anbi12d 644	. . . . . . 7 ⊢ (𝑏 = (minPolyAA‘𝑎) → (((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) ↔ (((minPolyAA‘𝑎)‘𝑎) = 0 ∧ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)))
20	19	rspcev 3579	. . . . . 6 ⊢ (((minPolyAA‘𝑎) ∈ (Poly‘ℚ) ∧ (((minPolyAA‘𝑎)‘𝑎) = 0 ∧ ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)) → ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))
21	7, 8, 12, 20	syl12anc 850	. . . . 5 ⊢ (𝑎 ∈ 𝔸 → ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1))
22	6, 21	jca 521	. . . 4 ⊢ (𝑎 ∈ 𝔸 → (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
23		simpl 488	. . . . . . . . 9 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ∈ (Poly‘ℚ))
24		coe0 26587	. . . . . . . . . . . . . . 15 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
25	24	fveq1i 6894	. . . . . . . . . . . . . 14 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = ((ℕ0 × {0})‘(deg‘0𝑝))
26		dgr0 26593	. . . . . . . . . . . . . . . 16 ⊢ (deg‘0𝑝) = 0
27		0nn0 12631	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℕ0
28	26, 27	eqeltri 2859	. . . . . . . . . . . . . . 15 ⊢ (deg‘0𝑝) ∈ ℕ0
29		c0ex 11310	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ V
30	29	fvconst2 7217	. . . . . . . . . . . . . . 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 2786	. . . . . . . . . . . . 13 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = 0
33		0ne1 12424	. . . . . . . . . . . . 13 ⊢ 0 ≠ 1
34	32, 33	eqnetri 3028	. . . . . . . . . . . 12 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1
35		fveq2 6893	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (coeff‘𝑏) = (coeff‘0𝑝))
36		fveq2 6893	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (deg‘𝑏) = (deg‘0𝑝))
37	35, 36	fveq12d 6900	. . . . . . . . . . . . 13 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘0𝑝)‘(deg‘0𝑝)))
38	37	neeq1d 3017	. . . . . . . . . . . 12 ⊢ (𝑏 = 0𝑝 → (((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1 ↔ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1))
39	34, 38	mpbiri 261	. . . . . . . . . . 11 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1)
40	39	necon2i 2992	. . . . . . . . . 10 ⊢ (((coeff‘𝑏)‘(deg‘𝑏)) = 1 → 𝑏 ≠ 0𝑝)
41	40	ad2antll 742	. . . . . . . . 9 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ≠ 0𝑝)
42		eldifsn 4747	. . . . . . . . 9 ⊢ (𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}) ↔ (𝑏 ∈ (Poly‘ℚ) ∧ 𝑏 ≠ 0𝑝))
43	23, 41, 42	sylanbrc 595	. . . . . . . 8 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}))
44		simprl 783	. . . . . . . 8 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑏‘𝑎) = 0)
45	43, 44	jca 521	. . . . . . 7 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝}) ∧ (𝑏‘𝑎) = 0))
46	45	reximi2 3098	. . . . . 6 ⊢ (∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0)
47	46	anim2i 629	. . . . 5 ⊢ ((𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0))
48		elqaa 26657	. . . . 5 ⊢ (𝑎 ∈ 𝔸 ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0))
49	47, 48	sylibr 237	. . . 4 ⊢ ((𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑎 ∈ 𝔸)
50	22, 49	impbii 212	. . 3 ⊢ (𝑎 ∈ 𝔸 ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
51	1, 5, 50	3bitr4ri 307	. 2 ⊢ (𝑎 ∈ 𝔸 ↔ 𝑎 ∈ (IntgOver‘ℚ))
52	51	eqriv 2760	1 ⊢ 𝔸 = (IntgOver‘ℚ)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ≠ wne 2958  ∃wrex 3089  {crab 3415   ⊆ wss 3899   ∖ cdif 4047  {csn 4587   × cxp 5652  ‘cfv 6546  ℂcc 11208  0cc0 11210  1c1 11211  ℕ₀cn0 12616  ℚcq 13085  0_𝑝c0p 26002  Polycply 26514  coeffccoe 26516  degcdgr 26517  𝔸caa 26649  deg_AAcdgraa 44282  minPolyAAcmpaa 44283  IntgOvercitgo 44299

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758  ax-inf2 9652  ax-cnex 11266  ax-resscn 11267  ax-1cn 11268  ax-icn 11269  ax-addcl 11270  ax-addrcl 11271  ax-mulcl 11272  ax-mulrcl 11273  ax-mulcom 11274  ax-addass 11275  ax-mulass 11276  ax-distr 11277  ax-i2m1 11278  ax-1ne0 11279  ax-1rid 11280  ax-rnegex 11281  ax-rrecex 11282  ax-cnre 11283  ax-pre-lttri 11284  ax-pre-lttrn 11285  ax-pre-ltadd 11286  ax-pre-mulgt0 11287  ax-pre-sup 11288

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-se 5608  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6310  df-ord 6371  df-on 6372  df-lim 6373  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-isom 6555  df-riota 7384  df-ov 7430  df-oprab 7431  df-mpo 7432  df-of 7700  df-om 7885  df-1st 8008  df-2nd 8009  df-frecs 8310  df-wrecs 8341  df-recs 8390  df-rdg 8429  df-1o 8487  df-er 8728  df-map 8860  df-pm 8861  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-sup 9444  df-inf 9445  df-oi 9514  df-card 10030  df-pnf 11355  df-mnf 11356  df-xr 11357  df-ltxr 11358  df-le 11359  df-sub 11553  df-neg 11554  df-div 11984  df-nn 12346  df-2 12415  df-3 12416  df-n0 12617  df-z 12704  df-uz 12976  df-q 13086  df-rp 13131  df-fz 13650  df-fzo 13799  df-fl 13942  df-mod 14020  df-seq 14155  df-exp 14215  df-hash 14485  df-cj 15278  df-re 15279  df-im 15280  df-sqrt 15414  df-abs 15415  df-clim 15667  df-rlim 15668  df-sum 15866  df-0p 26003  df-ply 26518  df-coe 26520  df-dgr 26521  df-aa 26650  df-dgraa 44284  df-mpaa 44285  df-itgo 44301

This theorem is used by: (None)