Theorem tendovalco 41228

Description: Value of composition of translations in a trace-preserving endomorphism. (Contributed by NM, 9-Jun-2013.)

Hypotheses

Ref	Expression
tendof.h	⊢ 𝐻 = (LHyp‘𝐾)
tendof.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendof.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)

Assertion

Ref	Expression
tendovalco	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻 ∧ 𝑆 ∈ 𝐸) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺)))

Proof of Theorem tendovalco

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
2		tendof.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
3		tendof.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4		eqid 2737	. . . . 5 ⊢ ((trL‘𝐾)‘𝑊) = ((trL‘𝐾)‘𝑊)
5		tendof.e	. . . . 5 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	istendo 41223	. . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (((trL‘𝐾)‘𝑊)‘(𝑆‘𝑓))(le‘𝐾)(((trL‘𝐾)‘𝑊)‘𝑓))))
7		coeq1 5807	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 ∘ 𝑔) = (𝐹 ∘ 𝑔))
8	7	fveq2d 6839	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑆‘(𝑓 ∘ 𝑔)) = (𝑆‘(𝐹 ∘ 𝑔)))
9		fveq2 6835	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑆‘𝑓) = (𝑆‘𝐹))
10	9	coeq1d 5811	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) = ((𝑆‘𝐹) ∘ (𝑆‘𝑔)))
11	8, 10	eqeq12d 2753	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ↔ (𝑆‘(𝐹 ∘ 𝑔)) = ((𝑆‘𝐹) ∘ (𝑆‘𝑔))))
12		coeq2 5808	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝐹 ∘ 𝑔) = (𝐹 ∘ 𝐺))
13	12	fveq2d 6839	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑆‘(𝐹 ∘ 𝑔)) = (𝑆‘(𝐹 ∘ 𝐺)))
14		fveq2 6835	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (𝑆‘𝑔) = (𝑆‘𝐺))
15	14	coeq2d 5812	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → ((𝑆‘𝐹) ∘ (𝑆‘𝑔)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺)))
16	13, 15	eqeq12d 2753	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((𝑆‘(𝐹 ∘ 𝑔)) = ((𝑆‘𝐹) ∘ (𝑆‘𝑔)) ↔ (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺))))
17	11, 16	rspc2v 3576	. . . . . 6 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺))))
18	17	com12 32	. . . . 5 ⊢ (∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺))))
19	18	3ad2ant2 1135	. . . 4 ⊢ ((𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (((trL‘𝐾)‘𝑊)‘(𝑆‘𝑓))(le‘𝐾)(((trL‘𝐾)‘𝑊)‘𝑓)) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺))))
20	6, 19	biimtrdi 253	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺)))))
21	20	3impia 1118	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻 ∧ 𝑆 ∈ 𝐸) → ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺))))
22	21	imp 406	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻 ∧ 𝑆 ∈ 𝐸) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝑆‘(𝐹 ∘ 𝐺)) = ((𝑆‘𝐹) ∘ (𝑆‘𝐺)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052   class class class wbr 5086   ∘ ccom 5629  ⟶wf 6489  ‘cfv 6493  lecple 17221  LHypclh 40447  LTrncltrn 40564  trLctrl 40621  TEndoctendo 41215

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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

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-pw 4544  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 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-map 8769  df-tendo 41218

This theorem is referenced by:  tendoco2  41231  tendococl  41235  tendodi1  41247  tendoicl  41259  cdlemi2  41282  tendospdi1  41483