Theorem ig1pval 26123

Description: Substitutions for the polynomial ideal generator function. (Contributed by Stefan O'Rear, 29-Mar-2015.) (Revised by AV, 25-Sep-2020.)

Hypotheses

Ref	Expression
ig1pval.p	⊢ 𝑃 = (Poly1‘𝑅)
ig1pval.g	⊢ 𝐺 = (idlGen1p‘𝑅)
ig1pval.z	⊢ 0 = (0g‘𝑃)
ig1pval.u	⊢ 𝑈 = (LIdeal‘𝑃)
ig1pval.d	⊢ 𝐷 = ( deg1 ‘𝑅)
ig1pval.m	⊢ 𝑀 = (Monic1p‘𝑅)

Assertion

Ref	Expression
ig1pval	⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈) → (𝐺‘𝐼) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))

Distinct variable groups:   𝑔,𝐼   𝑔,𝑀   𝑅,𝑔

Allowed substitution hints:   𝐷(𝑔)   𝑃(𝑔)   𝑈(𝑔)   𝐺(𝑔)   𝑉(𝑔)   0 (𝑔)

Proof of Theorem ig1pval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ig1pval.g	. . . 4 ⊢ 𝐺 = (idlGen1p‘𝑅)
2		elex 3490	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		fveq2 6897	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
4		ig1pval.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
5	3, 4	eqtr4di 2786	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
6	5	fveq2d 6901	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = (LIdeal‘𝑃))
7		ig1pval.u	. . . . . . . 8 ⊢ 𝑈 = (LIdeal‘𝑃)
8	6, 7	eqtr4di 2786	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = 𝑈)
9	5	fveq2d 6901	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = (0g‘𝑃))
10		ig1pval.z	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑃)
11	9, 10	eqtr4di 2786	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = 0 )
12	11	sneqd 4641	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → {(0g‘(Poly1‘𝑟))} = { 0 })
13	12	eqeq2d 2739	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑖 = {(0g‘(Poly1‘𝑟))} ↔ 𝑖 = { 0 }))
14		fveq2 6897	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (Monic1p‘𝑟) = (Monic1p‘𝑅))
15		ig1pval.m	. . . . . . . . . . 11 ⊢ 𝑀 = (Monic1p‘𝑅)
16	14, 15	eqtr4di 2786	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Monic1p‘𝑟) = 𝑀)
17	16	ineq2d 4212	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑖 ∩ (Monic1p‘𝑟)) = (𝑖 ∩ 𝑀))
18		fveq2 6897	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = ( deg1 ‘𝑅))
19		ig1pval.d	. . . . . . . . . . . 12 ⊢ 𝐷 = ( deg1 ‘𝑅)
20	18, 19	eqtr4di 2786	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = 𝐷)
21	20	fveq1d 6899	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (( deg1 ‘𝑟)‘𝑔) = (𝐷‘𝑔))
22	12	difeq2d 4120	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (𝑖 ∖ {(0g‘(Poly1‘𝑟))}) = (𝑖 ∖ { 0 }))
23	20, 22	imaeq12d 6064	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})) = (𝐷 “ (𝑖 ∖ { 0 })))
24	23	infeq1d 9501	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))
25	21, 24	eqeq12d 2744	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → ((( deg1 ‘𝑟)‘𝑔) = inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ) ↔ (𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))
26	17, 25	riotaeqbidv 7379	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))(( deg1 ‘𝑟)‘𝑔) = inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )) = (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))
27	13, 11, 26	ifbieq12d 4557	. . . . . . 7 ⊢ (𝑟 = 𝑅 → if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))(( deg1 ‘𝑟)‘𝑔) = inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ))) = if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))
28	8, 27	mpteq12dv 5239	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))(( deg1 ‘𝑟)‘𝑔) = inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )))) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
29		df-ig1p 26083	. . . . . 6 ⊢ idlGen1p = (𝑟 ∈ V ↦ (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))(( deg1 ‘𝑟)‘𝑔) = inf((( deg1 ‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )))))
30	28, 29, 7	mptfvmpt 7240	. . . . 5 ⊢ (𝑅 ∈ V → (idlGen1p‘𝑅) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
31	2, 30	syl 17	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (idlGen1p‘𝑅) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
32	1, 31	eqtrid 2780	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝐺 = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
33	32	fveq1d 6899	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝐺‘𝐼) = ((𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))‘𝐼))
34		eqeq1 2732	. . . 4 ⊢ (𝑖 = 𝐼 → (𝑖 = { 0 } ↔ 𝐼 = { 0 }))
35		ineq1 4205	. . . . 5 ⊢ (𝑖 = 𝐼 → (𝑖 ∩ 𝑀) = (𝐼 ∩ 𝑀))
36		difeq1 4113	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → (𝑖 ∖ { 0 }) = (𝐼 ∖ { 0 }))
37	36	imaeq2d 6063	. . . . . . 7 ⊢ (𝑖 = 𝐼 → (𝐷 “ (𝑖 ∖ { 0 })) = (𝐷 “ (𝐼 ∖ { 0 })))
38	37	infeq1d 9501	. . . . . 6 ⊢ (𝑖 = 𝐼 → inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))
39	38	eqeq2d 2739	. . . . 5 ⊢ (𝑖 = 𝐼 → ((𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ) ↔ (𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )))
40	35, 39	riotaeqbidv 7379	. . . 4 ⊢ (𝑖 = 𝐼 → (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )) = (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )))
41	34, 40	ifbieq2d 4555	. . 3 ⊢ (𝑖 = 𝐼 → if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))
42		eqid 2728	. . 3 ⊢ (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))
43	10	fvexi 6911	. . . 4 ⊢ 0 ∈ V
44		riotaex 7380	. . . 4 ⊢ (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )) ∈ V
45	43, 44	ifex 4579	. . 3 ⊢ if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))) ∈ V
46	41, 42, 45	fvmpt 7005	. 2 ⊢ (𝐼 ∈ 𝑈 → ((𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))‘𝐼) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))
47	33, 46	sylan9eq 2788	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈) → (𝐺‘𝐼) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099  Vcvv 3471   ∖ cdif 3944   ∩ cin 3946  ifcif 4529  {csn 4629   ↦ cmpt 5231   “ cima 5681  ‘cfv 6548  ℩crio 7375  infcinf 9465  ℝcr 11138   < clt 11279  0_gc0g 17421  LIdealclidl 21102  Poly₁cpl1 22096   deg₁ cdg1 26000  Monic_1pcmn1 26074  idlGen_1pcig1p 26078

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-riota 7376  df-sup 9466  df-inf 9467  df-ig1p 26083

This theorem is referenced by:  ig1pval2  26124  ig1pval3  26125