Theorem idlsrgval 33531

Description: Lemma for idlsrgbas 33532 through idlsrgtset 33536. (Contributed by Thierry Arnoux, 1-Jun-2024.)

Hypotheses

Ref	Expression
idlsrgval.1	⊢ 𝐼 = (LIdeal‘𝑅)
idlsrgval.2	⊢ ⊕ = (LSSum‘𝑅)
idlsrgval.3	⊢ 𝐺 = (mulGrp‘𝑅)
idlsrgval.4	⊢ ⊗ = (LSSum‘𝐺)

Assertion

Ref	Expression
idlsrgval	⊢ (𝑅 ∈ 𝑉 → (IDLsrg‘𝑅) = ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}))

Distinct variable groups:   𝑖,𝐼,𝑗   𝑅,𝑖,𝑗

Allowed substitution hints:   ⊕ (𝑖,𝑗)   ⊗ (𝑖,𝑗)   𝐺(𝑖,𝑗)   𝑉(𝑖,𝑗)

Proof of Theorem idlsrgval

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

Step	Hyp	Ref	Expression
1		elex 3501	. 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
2		fvexd 6921	. . . 4 ⊢ (𝑟 = 𝑅 → (LIdeal‘𝑟) ∈ V)
3		simpr 484	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → 𝑏 = (LIdeal‘𝑟))
4		simpl 482	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → 𝑟 = 𝑅)
5	4	fveq2d 6910	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (LIdeal‘𝑟) = (LIdeal‘𝑅))
6	3, 5	eqtrd 2777	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → 𝑏 = (LIdeal‘𝑅))
7		idlsrgval.1	. . . . . . . 8 ⊢ 𝐼 = (LIdeal‘𝑅)
8	6, 7	eqtr4di 2795	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → 𝑏 = 𝐼)
9	8	opeq2d 4880	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ⟨(Base‘ndx), 𝑏⟩ = ⟨(Base‘ndx), 𝐼⟩)
10	4	fveq2d 6910	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (LSSum‘𝑟) = (LSSum‘𝑅))
11		idlsrgval.2	. . . . . . . 8 ⊢ ⊕ = (LSSum‘𝑅)
12	10, 11	eqtr4di 2795	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (LSSum‘𝑟) = ⊕ )
13	12	opeq2d 4880	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ⟨(+g‘ndx), (LSSum‘𝑟)⟩ = ⟨(+g‘ndx), ⊕ ⟩)
14	4	fveq2d 6910	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (RSpan‘𝑟) = (RSpan‘𝑅))
15	4	fveq2d 6910	. . . . . . . . . . . . 13 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (mulGrp‘𝑟) = (mulGrp‘𝑅))
16		idlsrgval.3	. . . . . . . . . . . . 13 ⊢ 𝐺 = (mulGrp‘𝑅)
17	15, 16	eqtr4di 2795	. . . . . . . . . . . 12 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (mulGrp‘𝑟) = 𝐺)
18	17	fveq2d 6910	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (LSSum‘(mulGrp‘𝑟)) = (LSSum‘𝐺))
19		idlsrgval.4	. . . . . . . . . . 11 ⊢ ⊗ = (LSSum‘𝐺)
20	18, 19	eqtr4di 2795	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (LSSum‘(mulGrp‘𝑟)) = ⊗ )
21	20	oveqd 7448	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (𝑖(LSSum‘(mulGrp‘𝑟))𝑗) = (𝑖 ⊗ 𝑗))
22	14, 21	fveq12d 6913	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)) = ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))
23	8, 8, 22	mpoeq123dv 7508	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗))) = (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗))))
24	23	opeq2d 4880	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ⟨(.r‘ndx), (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)))⟩ = ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩)
25	9, 13, 24	tpeq123d 4748	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → {⟨(Base‘ndx), 𝑏⟩, ⟨(+g‘ndx), (LSSum‘𝑟)⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)))⟩} = {⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩})
26	8	rabeqdv 3452	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗} = {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})
27	8, 26	mpteq12dv 5233	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗}) = (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗}))
28	27	rneqd 5949	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗}) = ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗}))
29	28	opeq2d 4880	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ⟨(TopSet‘ndx), ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗})⟩ = ⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩)
30	8	sseq2d 4016	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ({𝑖, 𝑗} ⊆ 𝑏 ↔ {𝑖, 𝑗} ⊆ 𝐼))
31	30	anbi1d 631	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → (({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗) ↔ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)))
32	31	opabbidv 5209	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)} = {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)})
33	32	opeq2d 4880	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)}⟩ = ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩)
34	29, 33	preq12d 4741	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)}⟩} = {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩})
35	25, 34	uneq12d 4169	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (LIdeal‘𝑟)) → ({⟨(Base‘ndx), 𝑏⟩, ⟨(+g‘ndx), (LSSum‘𝑟)⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)}⟩}) = ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}))
36	2, 35	csbied 3935	. . 3 ⊢ (𝑟 = 𝑅 → ⦋(LIdeal‘𝑟) / 𝑏⦌({⟨(Base‘ndx), 𝑏⟩, ⟨(+g‘ndx), (LSSum‘𝑟)⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)}⟩}) = ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}))
37		df-idlsrg 33529	. . 3 ⊢ IDLsrg = (𝑟 ∈ V ↦ ⦋(LIdeal‘𝑟) / 𝑏⦌({⟨(Base‘ndx), 𝑏⟩, ⟨(+g‘ndx), (LSSum‘𝑟)⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝑏, 𝑗 ∈ 𝑏 ↦ ((RSpan‘𝑟)‘(𝑖(LSSum‘(mulGrp‘𝑟))𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝑏 ↦ {𝑗 ∈ 𝑏 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝑏 ∧ 𝑖 ⊆ 𝑗)}⟩}))
38		tpex 7766	. . . 4 ⊢ {⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∈ V
39		prex 5437	. . . 4 ⊢ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩} ∈ V
40	38, 39	unex 7764	. . 3 ⊢ ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}) ∈ V
41	36, 37, 40	fvmpt 7016	. 2 ⊢ (𝑅 ∈ V → (IDLsrg‘𝑅) = ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}))
42	1, 41	syl 17	1 ⊢ (𝑅 ∈ 𝑉 → (IDLsrg‘𝑅) = ({⟨(Base‘ndx), 𝐼⟩, ⟨(+g‘ndx), ⊕ ⟩, ⟨(.r‘ndx), (𝑖 ∈ 𝐼, 𝑗 ∈ 𝐼 ↦ ((RSpan‘𝑅)‘(𝑖 ⊗ 𝑗)))⟩} ∪ {⟨(TopSet‘ndx), ran (𝑖 ∈ 𝐼 ↦ {𝑗 ∈ 𝐼 ∣ ¬ 𝑖 ⊆ 𝑗})⟩, ⟨(le‘ndx), {⟨𝑖, 𝑗⟩ ∣ ({𝑖, 𝑗} ⊆ 𝐼 ∧ 𝑖 ⊆ 𝑗)}⟩}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2108  {crab 3436  Vcvv 3480  ⦋csb 3899   ∪ cun 3949   ⊆ wss 3951  {cpr 4628  {ctp 4630  ⟨cop 4632  {copab 5205   ↦ cmpt 5225  ran crn 5686  ‘cfv 6561  (class class class)co 7431   ∈ cmpo 7433  ndxcnx 17230  Basecbs 17247  +_gcplusg 17297  ._rcmulr 17298  TopSetcts 17303  lecple 17304  LSSumclsm 19652  mulGrpcmgp 20137  LIdealclidl 21216  RSpancrsp 21217  IDLsrgcidlsrg 33528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-tp 4631  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-iota 6514  df-fun 6563  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-idlsrg 33529

This theorem is referenced by:  idlsrgbas  33532  idlsrgplusg  33533  idlsrgmulr  33535  idlsrgtset  33536