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 37958
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 3512 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6670 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 erngset.h-r . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3syl6eqr 2874 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6670 . . . . . . 7 (𝑘 = 𝐾 → (TEndo‘𝑘) = (TEndo‘𝐾))
65fveq1d 6672 . . . . . 6 (𝑘 = 𝐾 → ((TEndo‘𝑘)‘𝑤) = ((TEndo‘𝐾)‘𝑤))
76opeq2d 4810 . . . . 5 (𝑘 = 𝐾 → ⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩ = ⟨(Base‘ndx), ((TEndo‘𝐾)‘𝑤)⟩)
8 fveq2 6670 . . . . . . . . 9 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
98fveq1d 6672 . . . . . . . 8 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
109mpteq1d 5155 . . . . . . 7 (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))
116, 6, 10mpoeq123dv 7229 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓)))) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓)))))
1211opeq2d 4810 . . . . 5 (𝑘 = 𝐾 → ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩ = ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩)
13 eqidd 2822 . . . . . . 7 (𝑘 = 𝐾 → (𝑡𝑠) = (𝑡𝑠))
146, 6, 13mpoeq123dv 7229 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠)) = (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠)))
1514opeq2d 4810 . . . . 5 (𝑘 = 𝐾 → ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠))⟩ = ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑡 ∈ ((TEndo‘𝐾)‘𝑤) ↦ (𝑡𝑠))⟩)
167, 12, 15tpeq123d 4684 . . . 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 5151 . . 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 37907 . . 3 EDRingR = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠𝑓) ∘ (𝑡𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡𝑠))⟩}))
1917, 18, 3mptfvmpt 6990 . 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 1537  wcel 2114  Vcvv 3494  {ctp 4571  cop 4573  cmpt 5146  ccom 5559  cfv 6355  cmpo 7158  ndxcnx 16480  Basecbs 16483  +gcplusg 16565  .rcmulr 16566  LHypclh 37135  LTrncltrn 37252  TEndoctendo 37903  EDRingRcedring-rN 37905
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-oprab 7160  df-mpo 7161  df-edring-rN 37907
This theorem is referenced by:  erngset-rN  37959
  Copyright terms: Public domain W3C validator