Theorem ig1pval 26503

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 3471	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		fveq2 6890	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
4		ig1pval.p	. . . . . . . . . 10 ⊢ 𝑃 = (Poly1‘𝑅)
5	3, 4	eqtr4di 2813	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
6	5	fveq2d 6894	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = (LIdeal‘𝑃))
7		ig1pval.u	. . . . . . . 8 ⊢ 𝑈 = (LIdeal‘𝑃)
8	6, 7	eqtr4di 2813	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = 𝑈)
9	5	fveq2d 6894	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = (0g‘𝑃))
10		ig1pval.z	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑃)
11	9, 10	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘(Poly1‘𝑟)) = 0 )
12	11	sneqd 4592	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → {(0g‘(Poly1‘𝑟))} = { 0 })
13	12	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑖 = {(0g‘(Poly1‘𝑟))} ↔ 𝑖 = { 0 }))
14		fveq2 6890	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (Monic1p‘𝑟) = (Monic1p‘𝑅))
15		ig1pval.m	. . . . . . . . . . 11 ⊢ 𝑀 = (Monic1p‘𝑅)
16	14, 15	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Monic1p‘𝑟) = 𝑀)
17	16	ineq2d 4116	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑖 ∩ (Monic1p‘𝑟)) = (𝑖 ∩ 𝑀))
18		fveq2 6890	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (deg1‘𝑟) = (deg1‘𝑅))
19		ig1pval.d	. . . . . . . . . . . 12 ⊢ 𝐷 = (deg1‘𝑅)
20	18, 19	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (deg1‘𝑟) = 𝐷)
21	20	fveq1d 6892	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → ((deg1‘𝑟)‘𝑔) = (𝐷‘𝑔))
22	12	difeq2d 4062	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (𝑖 ∖ {(0g‘(Poly1‘𝑟))}) = (𝑖 ∖ { 0 }))
23	20, 22	imaeq12d 6055	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → ((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})) = (𝐷 “ (𝑖 ∖ { 0 })))
24	23	infeq1d 9477	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))
25	21, 24	eqeq12d 2776	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (((deg1‘𝑟)‘𝑔) = inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ) ↔ (𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))
26	17, 25	riotaeqbidv 7384	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))((deg1‘𝑟)‘𝑔) = inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )) = (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))
27	13, 11, 26	ifbieq12d 4510	. . . . . . 7 ⊢ (𝑟 = 𝑅 → if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))((deg1‘𝑟)‘𝑔) = inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < ))) = if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))
28	8, 27	mpteq12dv 5191	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))((deg1‘𝑟)‘𝑔) = inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )))) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
29		df-ig1p 26462	. . . . . 6 ⊢ idlGen1p = (𝑟 ∈ V ↦ (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ if(𝑖 = {(0g‘(Poly1‘𝑟))}, (0g‘(Poly1‘𝑟)), (℩𝑔 ∈ (𝑖 ∩ (Monic1p‘𝑟))((deg1‘𝑟)‘𝑔) = inf(((deg1‘𝑟) “ (𝑖 ∖ {(0g‘(Poly1‘𝑟))})), ℝ, < )))))
30	28, 29, 7	mptfvmpt 7238	. . . . 5 ⊢ (𝑅 ∈ V → (idlGen1p‘𝑅) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
31	2, 30	syl 18	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (idlGen1p‘𝑅) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
32	1, 31	eqtrid 2807	. . 3 ⊢ (𝑅 ∈ 𝑉 → 𝐺 = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))))
33	32	fveq1d 6892	. 2 ⊢ (𝑅 ∈ 𝑉 → (𝐺‘𝐼) = ((𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))‘𝐼))
34		eqeq1 2764	. . . 4 ⊢ (𝑖 = 𝐼 → (𝑖 = { 0 } ↔ 𝐼 = { 0 }))
35		ineq1 4109	. . . . 5 ⊢ (𝑖 = 𝐼 → (𝑖 ∩ 𝑀) = (𝐼 ∩ 𝑀))
36		difeq1 4055	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → (𝑖 ∖ { 0 }) = (𝐼 ∖ { 0 }))
37	36	imaeq2d 6054	. . . . . . 7 ⊢ (𝑖 = 𝐼 → (𝐷 “ (𝑖 ∖ { 0 })) = (𝐷 “ (𝐼 ∖ { 0 })))
38	37	infeq1d 9477	. . . . . 6 ⊢ (𝑖 = 𝐼 → inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))
39	38	eqeq2d 2771	. . . . 5 ⊢ (𝑖 = 𝐼 → ((𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ) ↔ (𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )))
40	35, 39	riotaeqbidv 7384	. . . 4 ⊢ (𝑖 = 𝐼 → (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )) = (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )))
41	34, 40	ifbieq2d 4508	. . 3 ⊢ (𝑖 = 𝐼 → if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))
42		eqid 2760	. . 3 ⊢ (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < )))) = (𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))
43	10	fvexi 6904	. . . 4 ⊢ 0 ∈ V
44		riotaex 7385	. . . 4 ⊢ (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < )) ∈ V
45	43, 44	ifex 4532	. . 3 ⊢ if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))) ∈ V
46	41, 42, 45	fvmpt 6998	. 2 ⊢ (𝐼 ∈ 𝑈 → ((𝑖 ∈ 𝑈 ↦ if(𝑖 = { 0 }, 0 , (℩𝑔 ∈ (𝑖 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝑖 ∖ { 0 })), ℝ, < ))))‘𝐼) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))
47	33, 46	sylan9eq 2815	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈) → (𝐺‘𝐼) = if(𝐼 = { 0 }, 0 , (℩𝑔 ∈ (𝐼 ∩ 𝑀)(𝐷‘𝑔) = inf((𝐷 “ (𝐼 ∖ { 0 })), ℝ, < ))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4044   ∩ cin 4088  ifcif 4481  {csn 4584   ↦ cmpt 5185   “ cima 5654  ‘cfv 6543  ℩crio 7380  infcinf 9440  ℝcr 11206   < clt 11350  0_gc0g 17619  LIdealclidl 21493  Poly₁cpl1 22504  deg₁cdg1 26381  Monic_1pcmn1 26453  idlGen_1pcig1p 26457

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-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  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-id 5546  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-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-sup 9441  df-inf 9442  df-ig1p 26462

This theorem is used by:  ig1pval2  26504  ig1pval3  26505