Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  erngfset-rN Structured version   Visualization version   GIF version

Theorem erngfset-rN 40516
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.
StepHypRef Expression
1 elex 3482 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6890 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 erngset.h-r . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2784 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6890 . . . . . . 7 (𝑘 = 𝐾 → (TEndo‘𝑘) = (TEndo‘𝐾))
65fveq1d 6892 . . . . . 6 (𝑘 = 𝐾 → ((TEndo‘𝑘)‘𝑤) = ((TEndo‘𝐾)‘𝑤))
76opeq2d 4878 . . . . 5 (𝑘 = 𝐾 → ⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩ = ⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩)
8 fveq2 6890 . . . . . . . . 9 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
98fveq1d 6892 . . . . . . . 8 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
109mpteq1d 5238 . . . . . . 7 (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))
116, 6, 10mpoeq123dv 7489 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓)))) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓)))))
1211opeq2d 4878 . . . . 5 (𝑘 = 𝐾 → ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩ = ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩)
13 eqidd 2727 . . . . . . 7 (𝑘 = 𝐾 → (𝑡𝑠) = (𝑡𝑠))
146, 6, 13mpoeq123dv 7489 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠)) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠)))
1514opeq2d 4878 . . . . 5 (𝑘 = 𝐾 → ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠))⟩ = ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠))⟩)
167, 12, 15tpeq123d 4747 . . . 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‘𝐾)‘𝑤) ↦ (𝑡𝑠))⟩})
174, 16mpteq12dv 5234 . . 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 40465 . . 3 EDRingR = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠))⟩}))
1917, 18, 3mptfvmpt 7234 . 2 (𝐾 ∈ V → (EDRingR𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠))⟩}))
201, 19syl 17 1 (𝐾𝑉 → (EDRingR𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠))⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1534  wcel 2099  Vcvv 3462  {ctp 4627  cop 4629  cmpt 5226  ccom 5676  cfv 6543  cmpo 7415  ndxcnx 17187  Basecbs 17205  +gcplusg 17258  .rcmulr 17259  LHypclh 39693  LTrncltrn 39810  TEndoctendo 40461  EDRingRcedring-rN 40463
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 2697  ax-rep 5280  ax-sep 5294  ax-nul 5301  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3776  df-csb 3892  df-dif 3949  df-un 3951  df-in 3953  df-ss 3963  df-nul 4323  df-if 4524  df-sn 4624  df-pr 4626  df-tp 4628  df-op 4630  df-uni 4906  df-iun 4995  df-br 5144  df-opab 5206  df-mpt 5227  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-oprab 7417  df-mpo 7418  df-edring-rN 40465
This theorem is referenced by:  erngset-rN  40517
  Copyright terms: Public domain W3C validator