Theorem uc1pval 25209

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.

Step	Hyp	Ref	Expression
1		uc1pval.c	. 2 ⊢ 𝐶 = (Unic1p‘𝑅)
2		fveq2 6756	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
3		uc1pval.p	. . . . . . . 8 ⊢ 𝑃 = (Poly1‘𝑅)
4	2, 3	eqtr4di 2797	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
5	4	fveq2d 6760	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = (Base‘𝑃))
6		uc1pval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑃)
7	5, 6	eqtr4di 2797	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = 𝐵)
8	4	fveq2d 6760	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = (0g‘𝑃))
9		uc1pval.z	. . . . . . . 8 ⊢ 0 = (0g‘𝑃)
10	8, 9	eqtr4di 2797	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = 0 )
11	10	neeq2d 3003	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1‘𝑟)) ↔ 𝑓 ≠ 0 ))
12		fveq2 6756	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = ( deg1 ‘𝑅))
13		uc1pval.d	. . . . . . . . . 10 ⊢ 𝐷 = ( deg1 ‘𝑅)
14	12, 13	eqtr4di 2797	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = 𝐷)
15	14	fveq1d 6758	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (( deg1 ‘𝑟)‘𝑓) = (𝐷‘𝑓))
16	15	fveq2d 6760	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) = ((coe1‘𝑓)‘(𝐷‘𝑓)))
17		fveq2 6756	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18		uc1pval.u	. . . . . . . 8 ⊢ 𝑈 = (Unit‘𝑅)
19	17, 18	eqtr4di 2797	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
20	16, 19	eleq12d 2833	. . . . . 6 ⊢ (𝑟 = 𝑅 → (((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈))
21	11, 20	anbi12d 630	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)))
22	7, 21	rabeqbidv 3410	. . . 4 ⊢ (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
23		df-uc1p 25201	. . . 4 ⊢ Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
24	6	fvexi 6770	. . . . 5 ⊢ 𝐵 ∈ V
25	24	rabex 5251	. . . 4 ⊢ {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ∈ V
26	22, 23, 25	fvmpt 6857	. . 3 ⊢ (𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
27		fvprc 6748	. . . 4 ⊢ (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = ∅)
28		ssrab2 4009	. . . . . 6 ⊢ {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ 𝐵
29		fvprc 6748	. . . . . . . . . 10 ⊢ (¬ 𝑅 ∈ V → (Poly1‘𝑅) = ∅)
30	3, 29	syl5eq 2791	. . . . . . . . 9 ⊢ (¬ 𝑅 ∈ V → 𝑃 = ∅)
31	30	fveq2d 6760	. . . . . . . 8 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32		base0 16845	. . . . . . . 8 ⊢ ∅ = (Base‘∅)
33	31, 32	eqtr4di 2797	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑃) = ∅)
34	6, 33	syl5eq 2791	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
35	28, 34	sseqtrid 3969	. . . . 5 ⊢ (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅)
36		ss0 4329	. . . . 5 ⊢ ({𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
37	35, 36	syl 17	. . . 4 ⊢ (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
38	27, 37	eqtr4d 2781	. . 3 ⊢ (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
39	26, 38	pm2.61i 182	. 2 ⊢ (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}
40	1, 39	eqtri 2766	1 ⊢ 𝐶 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  {crab 3067  Vcvv 3422   ⊆ wss 3883  ∅c0 4253  ‘cfv 6418  Basecbs 16840  0_gc0g 17067  Unitcui 19796  Poly₁cpl1 21258  coe₁cco1 21259   deg₁ cdg1 25121  Unic_1pcuc1p 25196

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-1cn 10860  ax-addcl 10862

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-nn 11904  df-slot 16811  df-ndx 16823  df-base 16841  df-uc1p 25201

This theorem is referenced by:  isuc1p  25210