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 36032
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 3212 . 2 (𝐾𝑉𝐾 ∈ V)
2 fveq2 6191 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 tgrpset.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3syl6eqr 2674 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6191 . . . . . . 7 (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
65fveq1d 6193 . . . . . 6 (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
76opeq2d 4409 . . . . 5 (𝑘 = 𝐾 → ⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩ = ⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩)
8 eqidd 2623 . . . . . . 7 (𝑘 = 𝐾 → (𝑓𝑔) = (𝑓𝑔))
96, 6, 8mpt2eq123dv 6717 . . . . . 6 (𝑘 = 𝐾 → (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔)) = (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔)))
109opeq2d 4409 . . . . 5 (𝑘 = 𝐾 → ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩ = ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩)
117, 10preq12d 4276 . . . 4 (𝑘 = 𝐾 → {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩} = {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩})
124, 11mpteq12dv 4733 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩}) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
13 df-tgrp 36031 . . 3 TGrp = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓𝑔))⟩}))
14 fvex 6201 . . . . 5 (LHyp‘𝐾) ∈ V
153, 14eqeltri 2697 . . . 4 𝐻 ∈ V
1615mptex 6486 . . 3 (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}) ∈ V
1712, 13, 16fvmpt 6282 . 2 (𝐾 ∈ V → (TGrp‘𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
181, 17syl 17 1 (𝐾𝑉 → (TGrp‘𝐾) = (𝑤𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓𝑔))⟩}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  wcel 1990  Vcvv 3200  {cpr 4179  cop 4183  cmpt 4729  ccom 5118  cfv 5888  cmpt2 6652  ndxcnx 15854  Basecbs 15857  +gcplusg 15941  LHypclh 35270  LTrncltrn 35387  TGrpctgrp 36030
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-oprab 6654  df-mpt2 6655  df-tgrp 36031
This theorem is referenced by:  tgrpset  36033
  Copyright terms: Public domain W3C validator