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

Theorem uc1pval 26045
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 6858 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1𝑅)
42, 3eqtr4di 2782 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6862 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2782 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6862 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2782 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 2985 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6858 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2782 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1514fveq1d 6860 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑓) = (𝐷𝑓))
1615fveq2d 6862 . . . . . . 7 (𝑟 = 𝑅 → ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = ((coe1𝑓)‘(𝐷𝑓)))
17 fveq2 6858 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18 uc1pval.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
1917, 18eqtr4di 2782 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
2016, 19eleq12d 2822 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈))
2111, 20anbi12d 632 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)))
227, 21rabeqbidv 3424 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
23 df-uc1p 26037 . . . 4 Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
246fvexi 6872 . . . . 5 𝐵 ∈ V
2524rabex 5294 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ∈ V
2622, 23, 25fvmpt 6968 . . 3 (𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
27 fvprc 6850 . . . 4 𝑅 ∈ V → (Unic1p𝑅) = ∅)
28 ssrab2 4043 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ 𝐵
29 fvprc 6850 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2776 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6862 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32 base0 17184 . . . . . . . 8 ∅ = (Base‘∅)
3331, 32eqtr4di 2782 . . . . . . 7 𝑅 ∈ V → (Base‘𝑃) = ∅)
346, 33eqtrid 2776 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3989 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅)
36 ss0 4365 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3827, 37eqtr4d 2767 . . 3 𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
3926, 38pm2.61i 182 . 2 (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
401, 39eqtri 2752 1 𝐶 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1540  wcel 2109  wne 2925  {crab 3405  Vcvv 3447  wss 3914  c0 4296  cfv 6511  Basecbs 17179  0gc0g 17402  Unitcui 20264  Poly1cpl1 22061  coe1cco1 22062  deg1cdg1 25959  Unic1pcuc1p 26032
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-1cn 11126  ax-addcl 11128
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-nn 12187  df-slot 17152  df-ndx 17164  df-base 17180  df-uc1p 26037
This theorem is referenced by:  isuc1p  26046
  Copyright terms: Public domain W3C validator