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

Theorem mon1pval 26072
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 6822 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1𝑅)
42, 3eqtr4di 2784 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6826 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2784 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6826 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2784 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 2988 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6822 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2784 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1514fveq1d 6824 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑓) = (𝐷𝑓))
1615fveq2d 6826 . . . . . . 7 (𝑟 = 𝑅 → ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = ((coe1𝑓)‘(𝐷𝑓)))
17 fveq2 6822 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
18 mon1pval.o . . . . . . . 8 1 = (1r𝑅)
1917, 18eqtr4di 2784 . . . . . . 7 (𝑟 = 𝑅 → (1r𝑟) = 1 )
2016, 19eqeq12d 2747 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) = 1 ))
2111, 20anbi12d 632 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )))
227, 21rabeqbidv 3413 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
23 df-mon1 26061 . . . 4 Monic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = (1r𝑟))})
246fvexi 6836 . . . . 5 𝐵 ∈ V
2524rabex 5277 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ∈ V
2622, 23, 25fvmpt 6929 . . 3 (𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
27 fvprc 6814 . . . 4 𝑅 ∈ V → (Monic1p𝑅) = ∅)
28 ssrab2 4030 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ 𝐵
29 fvprc 6814 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2778 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6826 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
326, 31eqtrid 2778 . . . . . . 7 𝑅 ∈ V → 𝐵 = (Base‘∅))
33 base0 17122 . . . . . . 7 ∅ = (Base‘∅)
3432, 33eqtr4di 2784 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3977 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅)
36 ss0 4352 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )} = ∅)
3827, 37eqtr4d 2769 . . 3 𝑅 ∈ V → (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )})
3926, 38pm2.61i 182 . 2 (Monic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
401, 39eqtri 2754 1 𝑀 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) = 1 )}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1541  wcel 2111  wne 2928  {crab 3395  Vcvv 3436  wss 3902  c0 4283  cfv 6481  Basecbs 17117  0gc0g 17340  1rcur 20097  Poly1cpl1 22087  coe1cco1 22088  deg1cdg1 25984  Monic1pcmn1 26056
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11059  ax-1cn 11061  ax-addcl 11063
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-om 7797  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-nn 12123  df-slot 17090  df-ndx 17102  df-base 17118  df-mon1 26061
This theorem is referenced by:  ismon1p  26073
  Copyright terms: Public domain W3C validator