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

Theorem uc1pval 26099
Description: Value of the set of unitic 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𝑅)
uc1pval.c 𝐶 = (Unic1p𝑅)
uc1pval.u 𝑈 = (Unit‘𝑅)
Assertion
Ref Expression
uc1pval 𝐶 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
Distinct variable groups:   𝐵,𝑓   𝐷,𝑓   𝑅,𝑓   𝑈,𝑓   0 ,𝑓
Allowed substitution hints:   𝐶(𝑓)   𝑃(𝑓)

Proof of Theorem uc1pval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 uc1pval.c . 2 𝐶 = (Unic1p𝑅)
2 fveq2 6832 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1𝑅)
42, 3eqtr4di 2787 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6836 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2787 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6836 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2787 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 2990 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6832 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2787 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1514fveq1d 6834 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑓) = (𝐷𝑓))
1615fveq2d 6836 . . . . . . 7 (𝑟 = 𝑅 → ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = ((coe1𝑓)‘(𝐷𝑓)))
17 fveq2 6832 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18 uc1pval.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
1917, 18eqtr4di 2787 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
2016, 19eleq12d 2828 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈))
2111, 20anbi12d 632 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)))
227, 21rabeqbidv 3415 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
23 df-uc1p 26091 . . . 4 Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
246fvexi 6846 . . . . 5 𝐵 ∈ V
2524rabex 5282 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ∈ V
2622, 23, 25fvmpt 6939 . . 3 (𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
27 fvprc 6824 . . . 4 𝑅 ∈ V → (Unic1p𝑅) = ∅)
28 ssrab2 4030 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ 𝐵
29 fvprc 6824 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2781 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6836 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32 base0 17139 . . . . . . . 8 ∅ = (Base‘∅)
3331, 32eqtr4di 2787 . . . . . . 7 𝑅 ∈ V → (Base‘𝑃) = ∅)
346, 33eqtrid 2781 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3974 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅)
36 ss0 4352 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3827, 37eqtr4d 2772 . . 3 𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
3926, 38pm2.61i 182 . 2 (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
401, 39eqtri 2757 1 𝐶 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1541  wcel 2113  wne 2930  {crab 3397  Vcvv 3438  wss 3899  c0 4283  cfv 6490  Basecbs 17134  0gc0g 17357  Unitcui 20289  Poly1cpl1 22115  coe1cco1 22116  deg1cdg1 26013  Unic1pcuc1p 26086
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-cnex 11080  ax-1cn 11082  ax-addcl 11084
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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-om 7807  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-nn 12144  df-slot 17107  df-ndx 17119  df-base 17135  df-uc1p 26091
This theorem is referenced by:  isuc1p  26100
  Copyright terms: Public domain W3C validator