Theorem elmnc 44137

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 44134	. . . . 5 ⊢ Monic = (𝑠 ∈ 𝒫 ℂ ↦ {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
2	1	dmmptss 6242	. . . 4 ⊢ dom Monic ⊆ 𝒫 ℂ
3		elfvdm 6919	. . . 4 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ dom Monic )
4	2, 3	sselid 3929	. . 3 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
5	4	elpwid 4566	. 2 ⊢ (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ⊆ ℂ)
6		plybss 26512	. . 3 ⊢ (𝑃 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
7	6	adantr 486	. 2 ⊢ ((𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1) → 𝑆 ⊆ ℂ)
8		cnex 11281	. . . . . 6 ⊢ ℂ ∈ V
9	8	elpw2 5296	. . . . 5 ⊢ (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
10		fveq2 6885	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (Poly‘𝑠) = (Poly‘𝑆))
11		rabeq 3427	. . . . . . 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 5300	. . . . . 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 2847	. . 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 2763	. . . 4 ⊢ (𝑝 = 𝑃 → (((coeff‘𝑝)‘(deg‘𝑝)) = 1 ↔ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
22	21	elrab 3645	. . 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 2145  {crab 3413   ⊆ wss 3899  𝒫 cpw 4557  dom cdm 5651  ‘cfv 6538  ℂcc 11198  1c1 11201  Polycply 26502  coeffccoe 26504  degcdgr 26505   Monic cmnc 44132

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-sep 5249  ax-nul 5260  ax-pr 5391  ax-cnex 11256

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  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-iota 6494  df-fun 6540  df-fv 6546  df-ply 26506  df-mnc 44134

This theorem is used by:  mncply  44138  mnccoe  44139