| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > istendo | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| tendoset.l | ⊢ ≤ = (le‘𝐾) |
| tendoset.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| tendoset.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| tendoset.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| tendoset.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| istendo | ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
| 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 41553 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐸 = {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))}) |
| 7 | 6 | eleq2d 2849 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ 𝑆 ∈ {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))})) |
| 8 | 3 | fvexi 6895 | . . . . 5 ⊢ 𝑇 ∈ V |
| 9 | fex 7224 | . . . . 5 ⊢ ((𝑆:𝑇⟶𝑇 ∧ 𝑇 ∈ V) → 𝑆 ∈ V) | |
| 10 | 8, 9 | mpan2 703 | . . . 4 ⊢ (𝑆:𝑇⟶𝑇 → 𝑆 ∈ V) |
| 11 | 10 | 3ad2ant1 1151 | . . 3 ⊢ ((𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)) → 𝑆 ∈ V) |
| 12 | feq1 6683 | . . . 4 ⊢ (𝑠 = 𝑆 → (𝑠:𝑇⟶𝑇 ↔ 𝑆:𝑇⟶𝑇)) | |
| 13 | fveq1 6880 | . . . . . 6 ⊢ (𝑠 = 𝑆 → (𝑠‘(𝑓 ∘ 𝑔)) = (𝑆‘(𝑓 ∘ 𝑔))) | |
| 14 | fveq1 6880 | . . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠‘𝑓) = (𝑆‘𝑓)) | |
| 15 | fveq1 6880 | . . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠‘𝑔) = (𝑆‘𝑔)) | |
| 16 | 14, 15 | coeq12d 5850 | . . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔))) |
| 17 | 13, 16 | eqeq12d 2779 | . . . . 5 ⊢ (𝑠 = 𝑆 → ((𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))) |
| 18 | 17 | 2ralbidv 3229 | . . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ↔ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)))) |
| 19 | 14 | fveq2d 6885 | . . . . . 6 ⊢ (𝑠 = 𝑆 → (𝑅‘(𝑠‘𝑓)) = (𝑅‘(𝑆‘𝑓))) |
| 20 | 19 | breq1d 5119 | . . . . 5 ⊢ (𝑠 = 𝑆 → ((𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓) ↔ (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))) |
| 21 | 20 | ralbidv 3188 | . . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓) ↔ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))) |
| 22 | 12, 18, 21 | 3anbi123d 1464 | . . 3 ⊢ (𝑠 = 𝑆 → ((𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓)) ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
| 23 | 11, 22 | elab3 3645 | . 2 ⊢ (𝑆 ∈ {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))} ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))) |
| 24 | 7, 23 | bitrdi 290 | 1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 {cab 2741 ∀wral 3079 Vcvv 3455 class class class wbr 5109 ∘ ccom 5665 ⟶wf 6532 ‘cfv 6536 lecple 17312 LHypclh 40778 LTrncltrn 40895 trLctrl 40952 TEndoctendo 41546 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-map 8822 df-tendo 41549 |
| This theorem is referenced by: tendotp 41555 istendod 41556 tendof 41557 tendovalco 41559 |
| Copyright terms: Public domain | W3C validator |