Theorem istendo 41594

Description: The predicate "is a trace-preserving endomorphism". Similar to definition of trace-preserving endomorphism in [Crawley] p. 117, penultimate line. (Contributed by NM, 8-Jun-2013.)

Hypotheses

Ref	Expression
tendoset.l	⊢ ≤ = (le‘𝐾)
tendoset.h	⊢ 𝐻 = (LHyp‘𝐾)
tendoset.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
tendoset.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
tendoset.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)

Assertion

Ref	Expression
istendo	⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))

Distinct variable groups:   𝑓,𝑔,𝐾   𝑇,𝑓,𝑔   𝑓,𝑊,𝑔   𝑆,𝑓,𝑔

Allowed substitution hints:   𝑅(𝑓, 𝑔)   𝐸(𝑓, 𝑔)   𝐻(𝑓, 𝑔)   ≤ (𝑓, 𝑔)   𝑉(𝑓, 𝑔)

Proof of Theorem istendo

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tendoset.l	. . . 4 ⊢ ≤ = (le‘𝐾)
2		tendoset.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
3		tendoset.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4		tendoset.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
5		tendoset.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	tendoset 41593	. . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐸 = {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))})
7	6	eleq2d 2851	. 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))}))
8	3	fvexi 6899	. . . . 5 ⊢ 𝑇 ∈ V
9		fex 7231	. . . . 5 ⊢ ((𝑆:𝑇⟶𝑇 ∧ 𝑇 ∈ V) → 𝑆 ∈ V)
10	8, 9	mpan2 704	. . . 4 ⊢ (𝑆:𝑇⟶𝑇 → 𝑆 ∈ V)
11	10	3ad2ant1 1151	. . 3 ⊢ ((𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) → 𝑆 ∈ V)
12		feq1 6687	. . . 4 ⊢ (𝑠 = 𝑆 → (𝑠:𝑇⟶𝑇 ↔ 𝑆:𝑇⟶𝑇))
13		fveq1 6884	. . . . . 6 ⊢ (𝑠 = 𝑆 → (𝑠‘(𝑓 ∘ 𝑔)) = (𝑆‘(𝑓 ∘ 𝑔)))
14		fveq1 6884	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠‘𝑓) = (𝑆‘𝑓))
15		fveq1 6884	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠‘𝑔) = (𝑆‘𝑔))
16	14, 15	coeq12d 5852	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))
17	13, 16	eqeq12d 2781	. . . . 5 ⊢ (𝑠 = 𝑆 → ((𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))))
18	17	2ralbidv 3231	. . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))))
19	14	fveq2d 6889	. . . . . 6 ⊢ (𝑠 = 𝑆 → (𝑅‘(𝑠‘𝑓)) = (𝑅‘(𝑆‘𝑓)))
20	19	breq1d 5121	. . . . 5 ⊢ (𝑠 = 𝑆 → ((𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓) ↔ (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))
21	20	ralbidv 3190	. . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓) ↔ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))
22	12, 18, 21	3anbi123d 1464	. . 3 ⊢ (𝑠 = 𝑆 → ((𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓)) ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))
23	11, 22	elab3 3647	. 2 ⊢ (𝑆 ∈ {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))} ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))
24	7, 23	bitrdi 290	1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  {cab 2743  ∀wral 3081  Vcvv 3457   class class class wbr 5111   ∘ ccom 5667  ⟶wf 6536  ‘cfv 6540  lecple 17341  LHypclh 40818  LTrncltrn 40935  trLctrl 40992  TEndoctendo 41586

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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-tendo 41589

This theorem is used by:  tendotp  41595  istendod  41596  tendof  41597  tendovalco  41599