Theorem erngfset-rN 41688

Description: The division rings on trace-preserving endomorphisms for a lattice 𝐾. (Contributed by NM, 8-Jun-2013.) (New usage is discouraged.)

Hypothesis

Ref	Expression
erngset.h-r	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
erngfset-rN	⊢ (𝐾 ∈ 𝑉 → (EDRingR‘𝐾) = (𝑤 ∈ 𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))

Distinct variable groups:   𝑤,𝐻   𝑓,𝑠,𝑡,𝑤,𝐾

Allowed substitution hints:   𝐻(𝑡, 𝑓, 𝑠)   𝑉(𝑤, 𝑡, 𝑓, 𝑠)

Proof of Theorem erngfset-rN

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3474	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		fveq2 6882	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		erngset.h-r	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2815	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6882	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (TEndo‘𝑘) = (TEndo‘𝐾))
6	5	fveq1d 6884	. . . . . 6 ⊢ (𝑘 = 𝐾 → ((TEndo‘𝑘)‘𝑤) = ((TEndo‘𝐾)‘𝑤))
7	6	opeq2d 4843	. . . . 5 ⊢ (𝑘 = 𝐾 → ⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩ = ⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩)
8		fveq2 6882	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
9	8	fveq1d 6884	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
10	9	mpteq1d 5199	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))
11	6, 6, 10	mpoeq123dv 7492	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓)))) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓)))))
12	11	opeq2d 4843	. . . . 5 ⊢ (𝑘 = 𝐾 → ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩ = ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩)
13		eqidd 2763	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (𝑡 ∘ 𝑠) = (𝑡 ∘ 𝑠))
14	6, 6, 13	mpoeq123dv 7492	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠)) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠)))
15	14	opeq2d 4843	. . . . 5 ⊢ (𝑘 = 𝐾 → ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩ = ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩)
16	7, 12, 15	tpeq123d 4712	. . . 4 ⊢ (𝑘 = 𝐾 → {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩} = {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩})
17	4, 16	mpteq12dv 5196	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}) = (𝑤 ∈ 𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))
18		df-edring-rN 41637	. . 3 ⊢ EDRingR = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))
19	17, 18, 3	mptfvmpt 7231	. 2 ⊢ (𝐾 ∈ V → (EDRingR‘𝐾) = (𝑤 ∈ 𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))
20	1, 19	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → (EDRingR‘𝐾) = (𝑤 ∈ 𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453  {ctp 4591  ⟨cop 4593   ↦ cmpt 5190   ∘ ccom 5663  ‘cfv 6537   ∈ cmpo 7419  ndxcnx 17291  Basecbs 17307  +_gcplusg 17348  ._rcmulr 17349  LHypclh 40865  LTrncltrn 40982  TEndoctendo 41633  EDRing_Rcedring-rN 41635

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-oprab 7421  df-mpo 7422  df-edring-rN 41637

This theorem is used by:  erngset-rN  41689