MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mon1pval Structured version   Visualization version   GIF version

Theorem mon1pval 26117
Description: Value of the set of monic polynomials. (Contributed by Stefan O'Rear, 28-Mar-2015.)
Hypotheses
Ref Expression
uc1pval.p 𝑃 = (Poly1𝑅)
uc1pval.b 𝐵 = (Base‘𝑃)
uc1pval.z 0 = (0g𝑃)
uc1pval.d 𝐷 = (deg1𝑅)
mon1pval.m 𝑀 = (Monic1p𝑅)
mon1pval.o 1 = (1r𝑅)
Assertion
Ref Expression
mon1pval 𝑀 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
Distinct variable groups:   𝐵,𝑓   𝐷,𝑓   1 ,𝑓   𝑅,𝑓   0 ,𝑓
Allowed substitution hints:   𝑃(𝑓)   𝑀(𝑓)

Proof of Theorem mon1pval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 mon1pval.m . 2 𝑀 = (Monic1p𝑅)
2 fveq2 6834 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1𝑅)
42, 3eqtr4di 2790 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6838 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2790 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6838 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2790 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 2993 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6834 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2790 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1514fveq1d 6836 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑓) = (𝐷𝑓))
1615fveq2d 6838 . . . . . . 7 (𝑟 = 𝑅 → ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = ((coe1𝑓)‘(𝐷𝑓)))
17 fveq2 6834 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
18 mon1pval.o . . . . . . . 8 1 = (1r𝑅)
1917, 18eqtr4di 2790 . . . . . . 7 (𝑟 = 𝑅 → (1r𝑟) = 1 )
2016, 19eqeq12d 2753 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) = 1 ))
2111, 20anbi12d 633 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )))
227, 21rabeqbidv 3408 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
23 df-mon1 26106 . . . 4 Monic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))})
246fvexi 6848 . . . . 5 𝐵 ∈ V
2524rabex 5276 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ∈ V
2622, 23, 25fvmpt 6941 . . 3 (𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
27 fvprc 6826 . . . 4 𝑅 ∈ V → (Monic1p𝑅) = ∅)
28 ssrab2 4021 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ 𝐵
29 fvprc 6826 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2784 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6838 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
326, 31eqtrid 2784 . . . . . . 7 𝑅 ∈ V → 𝐵 = (Base‘∅))
33 base0 17175 . . . . . . 7 ∅ = (Base‘∅)
3432, 33eqtr4di 2790 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3965 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅)
36 ss0 4343 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3827, 37eqtr4d 2775 . . 3 𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
3926, 38pm2.61i 182 . 2 (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
401, 39eqtri 2760 1 𝑀 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1542  wcel 2114  wne 2933  {crab 3390  Vcvv 3430  wss 3890  c0 4274  cfv 6492  Basecbs 17170  0gc0g 17393  1rcur 20153  Poly1cpl1 22150  coe1cco1 22151  deg1cdg1 26029  Monic1pcmn1 26101
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-1cn 11087  ax-addcl 11089
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-nn 12166  df-slot 17143  df-ndx 17155  df-base 17171  df-mon1 26106
This theorem is referenced by:  ismon1p  26118
  Copyright terms: Public domain W3C validator