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

Theorem mon1pval 26132
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 2793 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6838 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2793 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6838 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2793 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 2995 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6834 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2793 . . . . . . . . 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 2793 . . . . . . 7 (𝑟 = 𝑅 → (1r𝑟) = 1 )
2016, 19eqeq12d 2756 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) = 1 ))
2111, 20anbi12d 638 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )))
227, 21rabeqbidv 3410 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
23 df-mon1 26121 . . . 4 Monic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))})
246fvexi 6848 . . . . 5 𝐵 ∈ V
2524rabex 5274 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ∈ V
2622, 23, 25fvmpt 6942 . . 3 (𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
27 fvprc 6826 . . . 4 𝑅 ∈ V → (Monic1p𝑅) = ∅)
28 ssrab2 4018 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ 𝐵
29 fvprc 6826 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2787 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6838 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
326, 31eqtrid 2787 . . . . . . 7 𝑅 ∈ V → 𝐵 = (Base‘∅))
33 base0 17182 . . . . . . 7 ∅ = (Base‘∅)
3432, 33eqtr4di 2793 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3964 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅)
36 ss0 4337 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3827, 37eqtr4d 2778 . . 3 𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
3926, 38pm2.61i 183 . 2 (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
401, 39eqtri 2763 1 𝑀 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 396   = wceq 1547  wcel 2119  wne 2935  {crab 3392  Vcvv 3432  wss 3890  c0 4268  cfv 6492  Basecbs 17177  0gc0g 17400  1rcur 20160  Poly1cpl1 22169  coe1cco1 22170  deg1cdg1 26044  Monic1pcmn1 26116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685  ax-cnex 11092  ax-1cn 11094  ax-addcl 11096
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 7366  df-om 7814  df-2nd 7939  df-frecs 8228  df-wrecs 8259  df-recs 8308  df-rdg 8346  df-nn 12173  df-slot 17150  df-ndx 17162  df-base 17178  df-mon1 26121
This theorem is referenced by:  ismon1p  26133
  Copyright terms: Public domain W3C validator