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

Theorem tgrpfset 41204
Description: The translation group maps for a lattice 𝐾. (Contributed by NM, 5-Jun-2013.)
Hypothesis
Ref Expression
tgrpset.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
tgrpfset (𝐾𝑉 → (TGrp‘𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
Distinct variable groups:   𝑤,𝐻   𝑓,𝑔,𝑤,𝐾
Allowed substitution hints:   𝐻(𝑓,𝑔)   𝑉(𝑤,𝑓,𝑔)

Proof of Theorem tgrpfset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3451 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6834 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 tgrpset.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3eqtr4di 2790 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6834 . . . . . . 7 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
65fveq1d 6836 . . . . . 6 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
76opeq2d 4824 . . . . 5 (𝑘 = 𝐾 → ⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩ = ⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩)
8 eqidd 2738 . . . . . . 7 (𝑘 = 𝐾 → (𝑓𝑔) = (𝑓𝑔))
96, 6, 8mpoeq123dv 7435 . . . . . 6 (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔)) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔)))
109opeq2d 4824 . . . . 5 (𝑘 = 𝐾 → ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩ = ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩)
117, 10preq12d 4686 . . . 4 (𝑘 = 𝐾 → {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩} = {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩})
124, 11mpteq12dv 5173 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩}) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
13 df-tgrp 41203 . . 3 TGrp = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩}))
1412, 13, 3mptfvmpt 7176 . 2 (𝐾 ∈ V → (TGrp‘𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
151, 14syl 17 1 (𝐾𝑉 → (TGrp‘𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3430  {cpr 4570  cop 4574  cmpt 5167  ccom 5628  cfv 6492  cmpo 7362  ndxcnx 17154  Basecbs 17170  +gcplusg 17211  LHypclh 40444  LTrncltrn 40561  TGrpctgrp 41202
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-oprab 7364  df-mpo 7365  df-tgrp 41203
This theorem is referenced by:  tgrpset  41205
  Copyright terms: Public domain W3C validator