Theorem hbtlem1 40948

Description: Value of the leading coefficient sequence function. (Contributed by Stefan O'Rear, 31-Mar-2015.)

Hypotheses

Ref	Expression
hbtlem.p	⊢ 𝑃 = (Poly1‘𝑅)
hbtlem.u	⊢ 𝑈 = (LIdeal‘𝑃)
hbtlem.s	⊢ 𝑆 = (ldgIdlSeq‘𝑅)
hbtlem.d	⊢ 𝐷 = ( deg1 ‘𝑅)

Assertion

Ref	Expression
hbtlem1	⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → ((𝑆‘𝐼)‘𝑋) = {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))})

Distinct variable groups:   𝑗,𝐼,𝑘   𝑅,𝑗,𝑘   𝑗,𝑋,𝑘

Allowed substitution hints:   𝐷(𝑗,𝑘)   𝑃(𝑗,𝑘)   𝑆(𝑗,𝑘)   𝑈(𝑗,𝑘)   𝑉(𝑗,𝑘)

Proof of Theorem hbtlem1

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

Step	Hyp	Ref	Expression
1		hbtlem.s	. . . . . 6 ⊢ 𝑆 = (ldgIdlSeq‘𝑅)
2		elex 3450	. . . . . . 7 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3		fveq2 6774	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = (Poly1‘𝑅))
4		hbtlem.p	. . . . . . . . . . . 12 ⊢ 𝑃 = (Poly1‘𝑅)
5	3, 4	eqtr4di 2796	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (Poly1‘𝑟) = 𝑃)
6	5	fveq2d 6778	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = (LIdeal‘𝑃))
7		hbtlem.u	. . . . . . . . . 10 ⊢ 𝑈 = (LIdeal‘𝑃)
8	6, 7	eqtr4di 2796	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (LIdeal‘(Poly1‘𝑟)) = 𝑈)
9		fveq2 6774	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = ( deg1 ‘𝑅))
10		hbtlem.d	. . . . . . . . . . . . . . . 16 ⊢ 𝐷 = ( deg1 ‘𝑅)
11	9, 10	eqtr4di 2796	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑅 → ( deg1 ‘𝑟) = 𝐷)
12	11	fveq1d 6776	. . . . . . . . . . . . . 14 ⊢ (𝑟 = 𝑅 → (( deg1 ‘𝑟)‘𝑘) = (𝐷‘𝑘))
13	12	breq1d 5084	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ↔ (𝐷‘𝑘) ≤ 𝑥))
14	13	anbi1d 630	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥)) ↔ ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))))
15	14	rexbidv 3226	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (∃𝑘 ∈ 𝑖 ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥)) ↔ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))))
16	15	abbidv 2807	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})
17	16	mpteq2dv 5176	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))
18	8, 17	mpteq12dv 5165	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})) = (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})))
19		df-ldgis 40947	. . . . . . . 8 ⊢ ldgIdlSeq = (𝑟 ∈ V ↦ (𝑖 ∈ (LIdeal‘(Poly1‘𝑟)) ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((( deg1 ‘𝑟)‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})))
20	18, 19, 7	mptfvmpt 7104	. . . . . . 7 ⊢ (𝑅 ∈ V → (ldgIdlSeq‘𝑅) = (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})))
21	2, 20	syl 17	. . . . . 6 ⊢ (𝑅 ∈ 𝑉 → (ldgIdlSeq‘𝑅) = (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})))
22	1, 21	eqtrid 2790	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → 𝑆 = (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})))
23	22	fveq1d 6776	. . . 4 ⊢ (𝑅 ∈ 𝑉 → (𝑆‘𝐼) = ((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼))
24	23	fveq1d 6776	. . 3 ⊢ (𝑅 ∈ 𝑉 → ((𝑆‘𝐼)‘𝑋) = (((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼)‘𝑋))
25	24	3ad2ant1 1132	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → ((𝑆‘𝐼)‘𝑋) = (((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼)‘𝑋))
26		rexeq 3343	. . . . . . 7 ⊢ (𝑖 = 𝐼 → (∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥)) ↔ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))))
27	26	abbidv 2807	. . . . . 6 ⊢ (𝑖 = 𝐼 → {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})
28	27	mpteq2dv 5176	. . . . 5 ⊢ (𝑖 = 𝐼 → (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))
29		eqid 2738	. . . . 5 ⊢ (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})) = (𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))
30		nn0ex 12239	. . . . . 6 ⊢ ℕ0 ∈ V
31	30	mptex 7099	. . . . 5 ⊢ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}) ∈ V
32	28, 29, 31	fvmpt 6875	. . . 4 ⊢ (𝐼 ∈ 𝑈 → ((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))
33	32	fveq1d 6776	. . 3 ⊢ (𝐼 ∈ 𝑈 → (((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼)‘𝑋) = ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})‘𝑋))
34	33	3ad2ant2 1133	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → (((𝑖 ∈ 𝑈 ↦ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝑖 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}))‘𝐼)‘𝑋) = ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})‘𝑋))
35		eqid 2738	. . 3 ⊢ (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))}) = (𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})
36		breq2 5078	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐷‘𝑘) ≤ 𝑥 ↔ (𝐷‘𝑘) ≤ 𝑋))
37		fveq2 6774	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ((coe1‘𝑘)‘𝑥) = ((coe1‘𝑘)‘𝑋))
38	37	eqeq2d 2749	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑗 = ((coe1‘𝑘)‘𝑥) ↔ 𝑗 = ((coe1‘𝑘)‘𝑋)))
39	36, 38	anbi12d 631	. . . . 5 ⊢ (𝑥 = 𝑋 → (((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥)) ↔ ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))))
40	39	rexbidv 3226	. . . 4 ⊢ (𝑥 = 𝑋 → (∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥)) ↔ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))))
41	40	abbidv 2807	. . 3 ⊢ (𝑥 = 𝑋 → {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))} = {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))})
42		simp3 1137	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → 𝑋 ∈ ℕ0)
43		simpr 485	. . . . . 6 ⊢ (((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋)) → 𝑗 = ((coe1‘𝑘)‘𝑋))
44	43	reximi 3178	. . . . 5 ⊢ (∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋)) → ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋))
45	44	ss2abi 4000	. . . 4 ⊢ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))} ⊆ {𝑗 ∣ ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋)}
46		abrexexg 7803	. . . . 5 ⊢ (𝐼 ∈ 𝑈 → {𝑗 ∣ ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋)} ∈ V)
47	46	3ad2ant2 1133	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → {𝑗 ∣ ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋)} ∈ V)
48		ssexg 5247	. . . 4 ⊢ (({𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))} ⊆ {𝑗 ∣ ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋)} ∧ {𝑗 ∣ ∃𝑘 ∈ 𝐼 𝑗 = ((coe1‘𝑘)‘𝑋)} ∈ V) → {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))} ∈ V)
49	45, 47, 48	sylancr 587	. . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))} ∈ V)
50	35, 41, 42, 49	fvmptd3 6898	. 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → ((𝑥 ∈ ℕ0 ↦ {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑥 ∧ 𝑗 = ((coe1‘𝑘)‘𝑥))})‘𝑋) = {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))})
51	25, 34, 50	3eqtrd 2782	1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑈 ∧ 𝑋 ∈ ℕ0) → ((𝑆‘𝐼)‘𝑋) = {𝑗 ∣ ∃𝑘 ∈ 𝐼 ((𝐷‘𝑘) ≤ 𝑋 ∧ 𝑗 = ((coe1‘𝑘)‘𝑋))})

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  {cab 2715  ∃wrex 3065  Vcvv 3432   ⊆ wss 3887   class class class wbr 5074   ↦ cmpt 5157  ‘cfv 6433   ≤ cle 11010  ℕ₀cn0 12233  LIdealclidl 20432  Poly₁cpl1 21348  coe₁cco1 21349   deg₁ cdg1 25216  ldgIdlSeqcldgis 40946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-1cn 10929  ax-addcl 10931

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-nn 11974  df-n0 12234  df-ldgis 40947

This theorem is referenced by:  hbtlem2  40949  hbtlem4  40951  hbtlem3  40952  hbtlem5  40953  hbtlem6  40954