Theorem elmnc 43923

Description: Property of a monic polynomial. (Contributed by Stefan O'Rear, 5-Dec-2014.)

Assertion

Ref	Expression
elmnc	⊢ (𝑃 ∈ ( Monic ‘𝑆) ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))

Proof of Theorem elmnc

Dummy variables 𝑠 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-mnc 43920	. . . . 5 ⊢ Monic = (𝑠 ∈ 𝒫 ℂ ↦ {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
2	1	dmmptss 6244	. . . 4 ⊢ dom Monic ⊆ 𝒫 ℂ
3		elfvdm 6919	. . . 4 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ dom Monic )
4	2, 3	sselid 3936	. . 3 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
5	4	elpwid 4573	. 2 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ⊆ ℂ)
6		plybss 26404	. . 3 ⊢ (𝑃 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
7	6	adantr 486	. 2 ⊢ ((𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1) → 𝑆 ⊆ ℂ)
8		cnex 11198	. . . . . 6 ⊢ ℂ ∈ V
9	8	elpw2 5307	. . . . 5 ⊢ (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
10		fveq2 6885	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (Poly‘𝑠) = (Poly‘𝑆))
11		rabeq 3432	. . . . . . 7 ⊢ ((Poly‘𝑠) = (Poly‘𝑆) → {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
12	10, 11	syl 18	. . . . . 6 ⊢ (𝑠 = 𝑆 → {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
13		fvex 6898	. . . . . . 7 ⊢ (Poly‘𝑆) ∈ V
14	13	rabex 5311	. . . . . 6 ⊢ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} ∈ V
15	12, 1, 14	fvmpt 6993	. . . . 5 ⊢ (𝑆 ∈ 𝒫 ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
16	9, 15	sylbir 238	. . . 4 ⊢ (𝑆 ⊆ ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
17	16	eleq2d 2851	. . 3 ⊢ (𝑆 ⊆ ℂ → (𝑃 ∈ ( Monic ‘𝑆) ↔ 𝑃 ∈ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1}))
18		fveq2 6885	. . . . . 6 ⊢ (𝑝 = 𝑃 → (coeff‘𝑝) = (coeff‘𝑃))
19		fveq2 6885	. . . . . 6 ⊢ (𝑝 = 𝑃 → (deg‘𝑝) = (deg‘𝑃))
20	18, 19	fveq12d 6892	. . . . 5 ⊢ (𝑝 = 𝑃 → ((coeff‘𝑝)‘(deg‘𝑝)) = ((coeff‘𝑃)‘(deg‘𝑃)))
21	20	eqeq1d 2767	. . . 4 ⊢ (𝑝 = 𝑃 → (((coeff‘𝑝)‘(deg‘𝑝)) = 1 ↔ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
22	21	elrab 3652	. . 3 ⊢ (𝑃 ∈ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
23	17, 22	bitrdi 290	. 2 ⊢ (𝑆 ⊆ ℂ → (𝑃 ∈ ( Monic ‘𝑆) ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1)))
24	5, 7, 23	pm5.21nii 381	1 ⊢ (𝑃 ∈ ( Monic ‘𝑆) ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {crab 3418   ⊆ wss 3906  𝒫 cpw 4564  dom cdm 5663  ‘cfv 6540  ℂcc 11115  1c1 11118  Polycply 26394  coeffccoe 26396  degcdgr 26397   Monic cmnc 43918

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-cnex 11173

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-ply 26398  df-mnc 43920

This theorem is used by:  mncply  43924  mnccoe  43925