Theorem elmnc 44278

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 44275	. . . . 5 ⊢ Monic = (𝑠 ∈ 𝒫 ℂ ↦ {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
2	1	dmmptss 6248	. . . 4 ⊢ dom Monic ⊆ 𝒫 ℂ
3		elfvdm 6927	. . . 4 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ dom Monic )
4	2, 3	sselid 3910	. . 3 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
5	4	elpwid 4568	. 2 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ⊆ ℂ)
6		plybss 26524	. . 3 ⊢ (𝑃 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
7	6	adantr 486	. 2 ⊢ ((𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1) → 𝑆 ⊆ ℂ)
8		cnex 11291	. . . . . 6 ⊢ ℂ ∈ V
9	8	elpw2 5299	. . . . 5 ⊢ (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
10		fveq2 6893	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (Poly‘𝑠) = (Poly‘𝑆))
11		rabeq 3429	. . . . . . 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 6906	. . . . . . 7 ⊢ (Poly‘𝑆) ∈ V
14	13	rabex 5303	. . . . . 6 ⊢ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} ∈ V
15	12, 1, 14	fvmpt 7001	. . . . 5 ⊢ (𝑆 ∈ 𝒫 ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
16	9, 15	sylbir 238	. . . 4 ⊢ (𝑆 ⊆ ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
17	16	eleq2d 2849	. . 3 ⊢ (𝑆 ⊆ ℂ → (𝑃 ∈ ( Monic ‘𝑆) ↔ 𝑃 ∈ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1}))
18		fveq2 6893	. . . . . 6 ⊢ (𝑝 = 𝑃 → (coeff‘𝑝) = (coeff‘𝑃))
19		fveq2 6893	. . . . . 6 ⊢ (𝑝 = 𝑃 → (deg‘𝑝) = (deg‘𝑃))
20	18, 19	fveq12d 6900	. . . . 5 ⊢ (𝑝 = 𝑃 → ((coeff‘𝑝)‘(deg‘𝑝)) = ((coeff‘𝑃)‘(deg‘𝑃)))
21	20	eqeq1d 2765	. . . 4 ⊢ (𝑝 = 𝑃 → (((coeff‘𝑝)‘(deg‘𝑝)) = 1 ↔ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
22	21	elrab 3647	. . 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 1569   ∈ wcel 2146  {crab 3415   ⊆ wss 3899  𝒫 cpw 4559  dom cdm 5654  ‘cfv 6546  ℂcc 11208  1c1 11211  Polycply 26514  coeffccoe 26516  degcdgr 26517   Monic cmnc 44273

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-sep 5251  ax-nul 5262  ax-pr 5394  ax-cnex 11266

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  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-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  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-iota 6500  df-fun 6548  df-fv 6554  df-ply 26518  df-mnc 44275

This theorem is used by:  mncply  44279  mnccoe  44280