Theorem uc1pval 25504

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 6842	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
3		uc1pval.p	. . . . . . . 8 ⊢ 𝑃 = (Poly1‘𝑅)
4	2, 3	eqtr4di 2794	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
5	4	fveq2d 6846	. . . . . 6 ⊢ (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = (Base‘𝑃))
6		uc1pval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑃)
7	5, 6	eqtr4di 2794	. . . . 5 ⊢ (𝑟 = 𝑅 → (Base‘(Poly1‘𝑟)) = 𝐵)
8	4	fveq2d 6846	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = (0g‘𝑃))
9		uc1pval.z	. . . . . . . 8 ⊢ 0 = (0g‘𝑃)
10	8, 9	eqtr4di 2794	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = 0 )
11	10	neeq2d 3004	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑓 ≠ (0g‘(Poly1‘𝑟)) ↔ 𝑓 ≠ 0 ))
12		fveq2 6842	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = ( deg1 ‘𝑅))
13		uc1pval.d	. . . . . . . . . 10 ⊢ 𝐷 = ( deg1 ‘𝑅)
14	12, 13	eqtr4di 2794	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = 𝐷)
15	14	fveq1d 6844	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (( deg1 ‘𝑟)‘𝑓) = (𝐷‘𝑓))
16	15	fveq2d 6846	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) = ((coe1‘𝑓)‘(𝐷‘𝑓)))
17		fveq2 6842	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
18		uc1pval.u	. . . . . . . 8 ⊢ 𝑈 = (Unit‘𝑅)
19	17, 18	eqtr4di 2794	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
20	16, 19	eleq12d 2832	. . . . . 6 ⊢ (𝑟 = 𝑅 → (((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟) ↔ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈))
21	11, 20	anbi12d 631	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟)) ↔ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)))
22	7, 21	rabeqbidv 3424	. . . 4 ⊢ (𝑟 = 𝑅 → {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))} = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
23		df-uc1p 25496	. . . 4 ⊢ Unic1p = (𝑟 ∈ V ↦ {𝑓 ∈ (Base‘(Poly1‘𝑟)) ∣ (𝑓 ≠ (0g‘(Poly1‘𝑟)) ∧ ((coe1‘𝑓)‘(( deg1 ‘𝑟)‘𝑓)) ∈ (Unit‘𝑟))})
24	6	fvexi 6856	. . . . 5 ⊢ 𝐵 ∈ V
25	24	rabex 5289	. . . 4 ⊢ {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ∈ V
26	22, 23, 25	fvmpt 6948	. . 3 ⊢ (𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
27		fvprc 6834	. . . 4 ⊢ (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = ∅)
28		ssrab2 4037	. . . . . 6 ⊢ {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ 𝐵
29		fvprc 6834	. . . . . . . . . 10 ⊢ (¬ 𝑅 ∈ V → (Poly1‘𝑅) = ∅)
30	3, 29	eqtrid 2788	. . . . . . . . 9 ⊢ (¬ 𝑅 ∈ V → 𝑃 = ∅)
31	30	fveq2d 6846	. . . . . . . 8 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑃) = (Base‘∅))
32		base0 17088	. . . . . . . 8 ⊢ ∅ = (Base‘∅)
33	31, 32	eqtr4di 2794	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑃) = ∅)
34	6, 33	eqtrid 2788	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
35	28, 34	sseqtrid 3996	. . . . 5 ⊢ (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅)
36		ss0 4358	. . . . 5 ⊢ ({𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} ⊆ ∅ → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
37	35, 36	syl 17	. . . 4 ⊢ (¬ 𝑅 ∈ V → {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)} = ∅)
38	27, 37	eqtr4d 2779	. . 3 ⊢ (¬ 𝑅 ∈ V → (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)})
39	26, 38	pm2.61i 182	. 2 ⊢ (Unic1p‘𝑅) = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}
40	1, 39	eqtri 2764	1 ⊢ 𝐶 = {𝑓 ∈ 𝐵 ∣ (𝑓 ≠ 0 ∧ ((coe1‘𝑓)‘(𝐷‘𝑓)) ∈ 𝑈)}

Syntax hints:  ¬ wn 3   ∧ wa 396   = wceq 1541   ∈ wcel 2106   ≠ wne 2943  {crab 3407  Vcvv 3445   ⊆ wss 3910  ∅c0 4282  ‘cfv 6496  Basecbs 17083  0_gc0g 17321  Unitcui 20068  Poly₁cpl1 21548  coe₁cco1 21549   deg₁ cdg1 25416  Unic_1pcuc1p 25491

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-1cn 11109  ax-addcl 11111

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-om 7803  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-nn 12154  df-slot 17054  df-ndx 17066  df-base 17084  df-uc1p 25496

This theorem is referenced by:  isuc1p  25505