Theorem tendofset 41573

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 3479	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		fveq2 6888	. . . . 5 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3		tendoset.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
4	2, 3	eqtr4di 2819	. . . 4 ⊢ (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5		fveq2 6888	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (LTrn‘𝑘) = (LTrn‘𝐾))
6	5	fveq1d 6890	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((LTrn‘𝑘)‘𝑤) = ((LTrn‘𝐾)‘𝑤))
7	6, 6	feq23d 6707	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ↔ 𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤)))
8	6	raleqdv 3326	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔))))
9	6, 8	raleqbidv 3341	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔))))
10		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (trL‘𝑘) = (trL‘𝐾))
11	10	fveq1d 6890	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → ((trL‘𝑘)‘𝑤) = ((trL‘𝐾)‘𝑤))
12	11	fveq1d 6890	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓)) = (((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)))
13		fveq2 6888	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
14		tendoset.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
15	13, 14	eqtr4di 2819	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
16	11	fveq1d 6890	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (((trL‘𝑘)‘𝑤)‘𝑓) = (((trL‘𝐾)‘𝑤)‘𝑓))
17	12, 15, 16	breq123d 5128	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓) ↔ (((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓)))
18	6, 17	raleqbidv 3341	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓) ↔ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓)))
19	7, 9, 18	3anbi123d 1464	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓)) ↔ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))))
20	19	abbidv 2832	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))} = {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))})
21	4, 20	mpteq12dv 5203	. . 3 ⊢ (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))}) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))
22		df-tendo 41570	. . 3 ⊢ TEndo = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑠 ∣ (𝑠:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑔 ∈ ((LTrn‘𝑘)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑠‘𝑓))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑓))}))
23	21, 22, 3	mptfvmpt 7233	. 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 2146  {cab 2744  ∀wral 3082  Vcvv 3458   class class class wbr 5114   ↦ cmpt 5197   ∘ ccom 5670  ⟶wf 6539  ‘cfv 6543  lecple 17342  LHypclh 40799  LTrncltrn 40916  trLctrl 40973  TEndoctendo 41567

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-tendo 41570

This theorem is used by:  tendoset  41574