| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > tendoicbv | Structured version Visualization version GIF version | ||
| Description: Define inverse function for trace-preserving endomorphisms. Change bound variable to isolate it later. (Contributed by NM, 12-Jun-2013.) |
| Ref | Expression |
|---|---|
| tendoi.i | ⊢ 𝐼 = (𝑠 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓))) |
| Ref | Expression |
|---|---|
| tendoicbv | ⊢ 𝐼 = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tendoi.i | . 2 ⊢ 𝐼 = (𝑠 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓))) | |
| 2 | fveq1 6881 | . . . . . 6 ⊢ (𝑠 = 𝑢 → (𝑠‘𝑓) = (𝑢‘𝑓)) | |
| 3 | 2 | cnveqd 5859 | . . . . 5 ⊢ (𝑠 = 𝑢 → ◡(𝑠‘𝑓) = ◡(𝑢‘𝑓)) |
| 4 | 3 | mpteq2dv 5203 | . . . 4 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓))) |
| 5 | fveq2 6882 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑢‘𝑓) = (𝑢‘𝑔)) | |
| 6 | 5 | cnveqd 5859 | . . . . 5 ⊢ (𝑓 = 𝑔 → ◡(𝑢‘𝑓) = ◡(𝑢‘𝑔)) |
| 7 | 6 | cbvmptv 5213 | . . . 4 ⊢ (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔)) |
| 8 | 4, 7 | eqtrdi 2813 | . . 3 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| 9 | 8 | cbvmptv 5213 | . 2 ⊢ (𝑠 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓))) = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| 10 | 1, 9 | eqtri 2785 | 1 ⊢ 𝐼 = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ↦ cmpt 5190 ◡ccnv 5658 ‘cfv 6537 |
| 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 2147 ax-9 2155 ax-ext 2734 |
| 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-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-cnv 5667 df-iota 6493 df-fv 6545 |
| This theorem is used by: tendoi 41654 |
| Copyright terms: Public domain | W3C validator |