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

Theorem uc1pval 26467
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 6890 . . . . . . . 8 (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
3 uc1pval.p . . . . . . . 8 𝑃 = (Poly1‘𝑅)
42, 3eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
54fveq2d 6894 . . . . . 6 (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = (Base‘𝑃))
6 uc1pval.b . . . . . 6 𝐵 = (Base‘𝑃)
75, 6eqtr4di 2813 . . . . 5 (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = 𝐵)
84fveq2d 6894 . . . . . . . 8 (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = (0g‘𝑃))
9 uc1pval.z . . . . . . . 8 0 = (0g‘𝑃)
108, 9eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = 0 )
1110neeq2d 3015 . . . . . 6 (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1‘𝑟)) ↔ 𝑓 ≠ 0 ))
12 fveq2 6890 . . . . . . . . . 10 (𝑟 = 𝑅 → (deg1‘𝑟) = (deg1‘𝑅))
13 uc1pval.d . . . . . . . . . 10 𝐷 = (deg1‘𝑅)
1412, 13eqtr4di 2813 . . . . . . . . 9 (𝑟 = 𝑅 → (deg1‘𝑟) = 𝐷)
1514fveq1d 6892 . . . . . . . 8 (𝑟 = 𝑅 → ((deg1‘𝑟)‘𝑓) = (𝐷‘𝑓))
1615fveq2d 6894 . . . . . . 7 (𝑟 = 𝑅 → ((coe1‘𝑓)‘((deg1‘𝑟)‘𝑓)) = ((coe1‘𝑓)‘(𝐷‘𝑓)))
17 fveq2 6890 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18 uc1pval.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
1917, 18eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
2016, 19eleq12d 2854 . . . . . 6 (𝑟 = 𝑅 → (((coe1‘𝑓)‘((deg1‘𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈))
2111, 20anbi12d 644 . . . . 5 (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘((deg1‘𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)))
227, 21rabeqbidv 3429 . . . 4 (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘((deg1‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
23 df-uc1p 26459 . . . 4 Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘((deg1‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
246fvexi 6904 . . . . 5 𝐵 ∈ V
2524rabex 5300 . . . 4 {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ∈ V
2622, 23, 25fvmpt 6998 . . 3 (𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
27 fvprc 6882 . . . 4 (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = ∅)
28 ssrab2 4004 . . . . . 6 {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ 𝐵
29 fvprc 6882 . . . . . . . . . 10 (¬ 𝑅 ∈ V → (Poly1‘𝑅) = ∅)
303, 29eqtrid 2807 . . . . . . . . 9 (¬ 𝑅 ∈ V → 𝑃 = ∅)
3130fveq2d 6894 . . . . . . . 8 (¬ 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32 base0 17401 . . . . . . . 8 ∅ = (Base‘∅)
3331, 32eqtr4di 2813 . . . . . . 7 (¬ 𝑅 ∈ V → (Base‘𝑃) = ∅)
346, 33eqtrid 2807 . . . . . 6 (¬ 𝑅 ∈ V → 𝐵 = ∅)
3528, 34sseqtrid 3951 . . . . 5 (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅)
36 ss0 4351 . . . . 5 ({𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
3735, 36syl 18 . . . 4 (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
3827, 37eqtr4d 2798 . . 3 (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
3926, 38pm2.61i 184 . 2 (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}
401, 39eqtri 2783 1 𝐶 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  {crab 3412  Vcvv 3450   ⊆ wss 3896  ∅c0 4277  ‘cfv 6543  Basecbs 17396  0gc0g 17619  Unitcui 20594  Poly1cpl1 22504  coe1cco1 22505  deg1cdg1 26381  Unic1pcuc1p 26454
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-cnex 11263  ax-1cn 11265  ax-addcl 11267
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-om 7882  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-nn 12343  df-slot 17369  df-ndx 17381  df-base 17397  df-uc1p 26459
This theorem is used by:  isuc1p  26468
  Copyright terms: Public domain W3C validator