Theorem tendofset 42018

Description: The set of all trace-preserving endomorphisms on the set of translations for a lattice 𝐾. (Contributed by NM, 8-Jun-2013.)

Hypotheses

Ref	Expression
tendoset.l	⊢ ≤ = (le‘𝐾)
tendoset.h	⊢ 𝐻 = (LHyp‘𝐾)

Assertion

Ref	Expression
tendofset	⊢ (𝐾 ∈ 𝑉 → (TEndo‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))

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

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

Proof of Theorem tendofset

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3475	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		fveq2 6911	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		tendoset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2816	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6911	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
6	5	fveq1d 6913	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
7	6, 6	feq23d 6729	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ↔ 𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤)))
8	6	raleqdv 3323	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔))))
9	6, 8	raleqbidv 3338	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔))))
10		fveq2 6911	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (trL‘𝑘) = (trL‘𝐾))
11	10	fveq1d 6913	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((trL‘𝑘)‘𝑤) = ((trL‘𝐾)‘𝑤))
12	11	fveq1d 6913	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓)) = (((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)))
13		fveq2 6911	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
14		tendoset.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
15	13, 14	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
16	11	fveq1d 6913	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘𝑓) = (((trL‘𝐾)‘𝑤)‘𝑓))
17	12, 15, 16	breq123d 5120	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓) ↔ (((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓)))
18	6, 17	raleqbidv 3338	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓) ↔ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓)))
19	7, 9, 18	3anbi123d 1465	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓)) ↔ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))))
20	19	abbidv 2829	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))} = {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))})
21	4, 20	mpteq12dv 5196	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))}) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))
22		df-tendo 42015	. . 3 ⊢ TEndo = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))}))
23	21, 22, 3	mptfvmpt 7260	. 2 ⊢ (𝐾 ∈ V → (TEndo‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))
24	1, 23	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → (TEndo‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  Vcvv 3454   class class class wbr 5106   ↦ cmpt 5190   ∘ ccom 5660  ⟶wf 6557  ‘cfv 6561  lecple 17467  LHypclh 41244  LTrncltrn 41361  trLctrl 41418  TEndoctendo 42012

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-tendo 42015

This theorem is used by:  tendoset  42019