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

Theorem uc1pval 26197
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 6867 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1𝑅)
42, 3eqtr4di 2815 . . . . . . 7 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
54fveq2d 6871 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2815 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
84fveq2d 6871 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = (0g𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g𝑃)
108, 9eqtr4di 2815 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1𝑟)) = 0 )
1110neeq2d 3017 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1𝑟)) ↔ 𝑓0 ))
12 fveq2 6867 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1𝑟) = (deg1𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1𝑅)
1412, 13eqtr4di 2815 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1𝑟) = 𝐷)
1514fveq1d 6869 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1𝑟)‘𝑓) = (𝐷𝑓))
1615fveq2d 6871 . . . . . . 7 (𝑟 = 𝑅 → ((coe1𝑓)‘((deg1𝑟)‘𝑓)) = ((coe1𝑓)‘(𝐷𝑓)))
17 fveq2 6867 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18 uc1pval.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
1917, 18eqtr4di 2815 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
2016, 19eleq12d 2856 . . . . . 6 (𝑟 = 𝑅 → (((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈))
2111, 20anbi12d 641 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)))
227, 21rabeqbidv 3432 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
23 df-uc1p 26189 . . . 4 Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1𝑟)) ∧ ((coe1𝑓)‘((deg1𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
246fvexi 6881 . . . . 5 𝐵 ∈ V
2524rabex 5295 . . . 4 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ∈ V
2622, 23, 25fvmpt 6975 . . 3 (𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
27 fvprc 6859 . . . 4 𝑅 ∈ V → (Unic1p𝑅) = ∅)
28 ssrab2 4033 . . . . . 6 {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ 𝐵
29 fvprc 6859 . . . . . . . . . 10 𝑅 ∈ V → (Poly1𝑅) = ∅)
303, 29eqtrid 2809 . . . . . . . . 9 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6871 . . . . . . . 8 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32 base0 17250 . . . . . . . 8 ∅ = (Base‘∅)
3331, 32eqtr4di 2815 . . . . . . 7 𝑅 ∈ V → (Base‘𝑃) = ∅)
346, 33eqtrid 2809 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3978 . . . . 5 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅)
36 ss0 4356 . . . . 5 ({𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3735, 36syl 17 . . . 4 𝑅 ∈ V → {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)} = ∅)
3827, 37eqtr4d 2800 . . 3 𝑅 ∈ V → (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)})
3926, 38pm2.61i 183 . 2 (Unic1p𝑅) = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
401, 39eqtri 2785 1 𝐶 = {𝑓𝐵 ∣ (𝑓0 ∧ ((coe1𝑓)‘(𝐷𝑓)) ∈ 𝑈)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1560  wcel 2142  wne 2957  {crab 3414  Vcvv 3454  wss 3904  c0 4285  cfv 6521  Basecbs 17245  0gc0g 17468  Unitcui 20400  Poly1cpl1 22236  coe1cco1 22237  deg1cdg1 26111  Unic1pcuc1p 26184
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-cnex 11129  ax-1cn 11131  ax-addcl 11133
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-nn 12211  df-slot 17218  df-ndx 17230  df-base 17246  df-uc1p 26189
This theorem is referenced by:  isuc1p  26198
  Copyright terms: Public domain W3C validator