![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > istendod | Structured version Visualization version GIF version |
Description: Deduce the predicate "is a trace-preserving endomorphism". (Contributed by NM, 9-Jun-2013.) |
Ref | Expression |
---|---|
tendoset.l | ⊢ ≤ = (le‘𝐾) |
tendoset.h | ⊢ 𝐻 = (LHyp‘𝐾) |
tendoset.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
tendoset.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
tendoset.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
istendod.1 | ⊢ (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻)) |
istendod.2 | ⊢ (𝜑 → 𝑆:𝑇⟶𝑇) |
istendod.3 | ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
istendod.4 | ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) |
Ref | Expression |
---|---|
istendod | ⊢ (𝜑 → 𝑆 ∈ 𝐸) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | istendod.2 | . 2 ⊢ (𝜑 → 𝑆:𝑇⟶𝑇) | |
2 | istendod.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) | |
3 | 2 | 3expb 1110 | . . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑇 ∧ 𝑔 ∈ 𝑇)) → (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
4 | 3 | ralrimivva 3152 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
5 | istendod.4 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) | |
6 | 5 | ralrimiva 3147 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) |
7 | istendod.1 | . . 3 ⊢ (𝜑 → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻)) | |
8 | tendoset.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
9 | tendoset.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
10 | tendoset.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
11 | tendoset.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
12 | tendoset.e | . . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
13 | 8, 9, 10, 11, 12 | istendo 36909 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
14 | 7, 13 | syl 17 | . 2 ⊢ (𝜑 → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
15 | 1, 4, 6, 14 | mpbir3and 1399 | 1 ⊢ (𝜑 → 𝑆 ∈ 𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 ∧ w3a 1071 = wceq 1601 ∈ wcel 2106 ∀wral 3089 class class class wbr 4886 ∘ ccom 5359 ⟶wf 6131 ‘cfv 6135 lecple 16345 LHypclh 36133 LTrncltrn 36250 trLctrl 36307 TEndoctendo 36901 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2054 ax-8 2108 ax-9 2115 ax-10 2134 ax-11 2149 ax-12 2162 ax-13 2333 ax-ext 2753 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2550 df-eu 2586 df-clab 2763 df-cleq 2769 df-clel 2773 df-nfc 2920 df-ne 2969 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3399 df-sbc 3652 df-csb 3751 df-dif 3794 df-un 3796 df-in 3798 df-ss 3805 df-nul 4141 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-op 4404 df-uni 4672 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-id 5261 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-ov 6925 df-oprab 6926 df-mpt2 6927 df-map 8142 df-tendo 36904 |
This theorem is referenced by: tendoidcl 36918 tendococl 36921 tendoplcl 36930 tendo0cl 36939 tendoicl 36945 cdlemk56 37120 |
Copyright terms: Public domain | W3C validator |