Theorem aaitgo 44163

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 3433	. . 3 ⊢ (𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)} ↔ (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)))
2		qsscn 13087	. . . . 5 ⊢ ℚ ⊆ ℂ
3		itgoval 44162	. . . . 5 ⊢ (ℚ ⊆ ℂ → (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
4	2, 3	ax-mp 5	. . . 4 ⊢ (IntgOver‘ℚ) = {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)}
5	4	eleq2i 2853	. . 3 ⊢ (𝑎 ∈ (IntgOver‘ℚ) ↔ 𝑎 ∈ {𝑎 ∈ ℂ ∣ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)})
6		aacn 26640	. . . . 5 ⊢ (𝑎 ∈ 𝔸 → 𝑎 ∈ ℂ)
7		mpaacl 44154	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → (minPolyAA‘𝑎) ∈ (Poly‘ℚ))
8		mpaaroot 44156	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((minPolyAA‘𝑎)‘𝑎) = 0)
9		mpaadgr 44155	. . . . . . . 8 ⊢ (𝑎 ∈ 𝔸 → (deg‘(minPolyAA‘𝑎)) = (degAA‘𝑎))
10	9	fveq2d 6889	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)))
11		mpaamn 44157	. . . . . . 7 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(degAA‘𝑎)) = 1)
12	10, 11	eqtrd 2796	. . . . . 6 ⊢ (𝑎 ∈ 𝔸 → ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))) = 1)
13		fveq1 6884	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → (𝑏‘𝑎) = ((minPolyAA‘𝑎)‘𝑎))
14	13	eqeq1d 2763	. . . . . . . 8 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((𝑏‘𝑎) = 0 ↔ ((minPolyAA‘𝑎)‘𝑎) = 0))
15		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (coeff‘𝑏) = (coeff‘(minPolyAA‘𝑎)))
16		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑏 = (minPolyAA‘𝑎) → (deg‘𝑏) = (deg‘(minPolyAA‘𝑎)))
17	15, 16	fveq12d 6892	. . . . . . . . 9 ⊢ (𝑏 = (minPolyAA‘𝑎) → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘(minPolyAA‘𝑎))‘(deg‘(minPolyAA‘𝑎))))
18	17	eqeq1d 2763	. . . . . . . 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 3577	. . . . . 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 26575	. . . . . . . . . . . . . . 15 ⊢ (coeff‘0𝑝) = (ℕ0 × {0})
25	24	fveq1i 6886	. . . . . . . . . . . . . 14 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = ((ℕ0 × {0})‘(deg‘0𝑝))
26		dgr0 26581	. . . . . . . . . . . . . . . 16 ⊢ (deg‘0𝑝) = 0
27		0nn0 12621	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℕ0
28	26, 27	eqeltri 2857	. . . . . . . . . . . . . . 15 ⊢ (deg‘0𝑝) ∈ ℕ0
29		c0ex 11300	. . . . . . . . . . . . . . . 16 ⊢ 0 ∈ V
30	29	fvconst2 7210	. . . . . . . . . . . . . . 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 2784	. . . . . . . . . . . . 13 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) = 0
33		0ne1 12414	. . . . . . . . . . . . 13 ⊢ 0 ≠ 1
34	32, 33	eqnetri 3026	. . . . . . . . . . . 12 ⊢ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1
35		fveq2 6885	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (coeff‘𝑏) = (coeff‘0𝑝))
36		fveq2 6885	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 0𝑝 → (deg‘𝑏) = (deg‘0𝑝))
37	35, 36	fveq12d 6892	. . . . . . . . . . . . 13 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) = ((coeff‘0𝑝)‘(deg‘0𝑝)))
38	37	neeq1d 3015	. . . . . . . . . . . 12 ⊢ (𝑏 = 0𝑝 → (((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1 ↔ ((coeff‘0𝑝)‘(deg‘0𝑝)) ≠ 1))
39	34, 38	mpbiri 261	. . . . . . . . . . 11 ⊢ (𝑏 = 0𝑝 → ((coeff‘𝑏)‘(deg‘𝑏)) ≠ 1)
40	39	necon2i 2990	. . . . . . . . . 10 ⊢ (((coeff‘𝑏)‘(deg‘𝑏)) = 1 → 𝑏 ≠ 0𝑝)
41	40	ad2antll 742	. . . . . . . . 9 ⊢ ((𝑏 ∈ (Poly‘ℚ) ∧ ((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → 𝑏 ≠ 0𝑝)
42		eldifsn 4748	. . . . . . . . 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 3096	. . . . . 6 ⊢ (∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1) → ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0)
47	46	anim2i 629	. . . . 5 ⊢ ((𝑎 ∈ ℂ ∧ ∃𝑏 ∈ (Poly‘ℚ)((𝑏‘𝑎) = 0 ∧ ((coeff‘𝑏)‘(deg‘𝑏)) = 1)) → (𝑎 ∈ ℂ ∧ ∃𝑏 ∈ ((Poly‘ℚ) ∖ {0𝑝})(𝑏‘𝑎) = 0))
48		elqaa 26645	. . . . 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 2758	1 ⊢ 𝔸 = (IntgOver‘ℚ)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∃wrex 3087  {crab 3413   ∖ cdif 3896   ⊆ wss 3899  {csn 4584   × cxp 5649  ‘cfv 6538  ℂcc 11198  0cc0 11200  1c1 11201  ℕ₀cn0 12606  ℚcq 13075  0_𝑝c0p 25990  Polycply 26502  coeffccoe 26504  degcdgr 26505  𝔸caa 26637  deg_AAcdgraa 44141  minPolyAAcmpaa 44142  IntgOvercitgo 44158

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-inf2 9642  ax-cnex 11256  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277  ax-pre-sup 11278

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-er 8717  df-map 8849  df-pm 8850  df-en 8974  df-dom 8975  df-sdom 8976  df-fin 8977  df-sup 9434  df-inf 9435  df-oi 9504  df-card 10020  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405  df-3 12406  df-n0 12607  df-z 12694  df-uz 12966  df-q 13076  df-rp 13121  df-fz 13640  df-fzo 13789  df-fl 13932  df-mod 14010  df-seq 14145  df-exp 14205  df-hash 14475  df-cj 15266  df-re 15267  df-im 15268  df-sqrt 15402  df-abs 15403  df-clim 15655  df-rlim 15656  df-sum 15854  df-0p 25991  df-ply 26506  df-coe 26508  df-dgr 26509  df-aa 26638  df-dgraa 44143  df-mpaa 44144  df-itgo 44160

This theorem is used by: (None)