Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elmnc Structured version   Visualization version   GIF version

Theorem elmnc 40877
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.
StepHypRef Expression
1 df-mnc 40874 . . . . 5 Monic = (𝑠 ∈ 𝒫 ℂ ↦ {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
21dmmptss 6133 . . . 4 dom Monic ⊆ 𝒫 ℂ
3 elfvdm 6788 . . . 4 (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ dom Monic )
42, 3sselid 3915 . . 3 (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ∈ 𝒫 ℂ)
54elpwid 4541 . 2 (𝑃 ∈ ( Monic ‘𝑆) → 𝑆 ⊆ ℂ)
6 plybss 25260 . . 3 (𝑃 ∈ (Poly‘𝑆) → 𝑆 ⊆ ℂ)
76adantr 480 . 2 ((𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1) → 𝑆 ⊆ ℂ)
8 cnex 10883 . . . . . 6 ℂ ∈ V
98elpw2 5264 . . . . 5 (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
10 fveq2 6756 . . . . . . 7 (𝑠 = 𝑆 → (Poly‘𝑠) = (Poly‘𝑆))
11 rabeq 3408 . . . . . . 7 ((Poly‘𝑠) = (Poly‘𝑆) → {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
1210, 11syl 17 . . . . . 6 (𝑠 = 𝑆 → {𝑝 ∈ (Poly‘𝑠) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
13 fvex 6769 . . . . . . 7 (Poly‘𝑆) ∈ V
1413rabex 5251 . . . . . 6 {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} ∈ V
1512, 1, 14fvmpt 6857 . . . . 5 (𝑆 ∈ 𝒫 ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
169, 15sylbir 234 . . . 4 (𝑆 ⊆ ℂ → ( Monic ‘𝑆) = {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1})
1716eleq2d 2824 . . 3 (𝑆 ⊆ ℂ → (𝑃 ∈ ( Monic ‘𝑆) ↔ 𝑃 ∈ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1}))
18 fveq2 6756 . . . . . 6 (𝑝 = 𝑃 → (coeff‘𝑝) = (coeff‘𝑃))
19 fveq2 6756 . . . . . 6 (𝑝 = 𝑃 → (deg‘𝑝) = (deg‘𝑃))
2018, 19fveq12d 6763 . . . . 5 (𝑝 = 𝑃 → ((coeff‘𝑝)‘(deg‘𝑝)) = ((coeff‘𝑃)‘(deg‘𝑃)))
2120eqeq1d 2740 . . . 4 (𝑝 = 𝑃 → (((coeff‘𝑝)‘(deg‘𝑝)) = 1 ↔ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
2221elrab 3617 . . 3 (𝑃 ∈ {𝑝 ∈ (Poly‘𝑆) ∣ ((coeff‘𝑝)‘(deg‘𝑝)) = 1} ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
2317, 22bitrdi 286 . 2 (𝑆 ⊆ ℂ → (𝑃 ∈ ( Monic ‘𝑆) ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1)))
245, 7, 23pm5.21nii 379 1 (𝑃 ∈ ( Monic ‘𝑆) ↔ (𝑃 ∈ (Poly‘𝑆) ∧ ((coeff‘𝑃)‘(deg‘𝑃)) = 1))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395   = wceq 1539  wcel 2108  {crab 3067  wss 3883  𝒫 cpw 4530  dom cdm 5580  cfv 6418  cc 10800  1c1 10803  Polycply 25250  coeffccoe 25252  degcdgr 25253   Monic cmnc 40872
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-cnex 10858
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fv 6426  df-ply 25254  df-mnc 40874
This theorem is referenced by:  mncply  40878  mnccoe  40879
  Copyright terms: Public domain W3C validator