| 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 6871 | . . . . . 6 ⊢ (𝑠 = 𝑢 → (𝑠‘𝑓) = (𝑢‘𝑓)) | |
| 3 | 2 | cnveqd 5852 | . . . . 5 ⊢ (𝑠 = 𝑢 → ◡(𝑠‘𝑓) = ◡(𝑢‘𝑓)) |
| 4 | 3 | mpteq2dv 5212 | . . . 4 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓))) |
| 5 | fveq2 6872 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑢‘𝑓) = (𝑢‘𝑔)) | |
| 6 | 5 | cnveqd 5852 | . . . . 5 ⊢ (𝑓 = 𝑔 → ◡(𝑢‘𝑓) = ◡(𝑢‘𝑔)) |
| 7 | 6 | cbvmptv 5222 | . . . 4 ⊢ (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔)) |
| 8 | 4, 7 | eqtrdi 2785 | . . 3 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| 9 | 8 | cbvmptv 5222 | . 2 ⊢ (𝑠 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓))) = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| 10 | 1, 9 | eqtri 2757 | 1 ⊢ 𝐼 = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1539 ↦ cmpt 5198 ◡ccnv 5650 ‘cfv 6527 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-rab 3414 df-v 3459 df-dif 3927 df-un 3929 df-ss 3941 df-nul 4307 df-if 4499 df-sn 4600 df-pr 4602 df-op 4606 df-uni 4881 df-br 5117 df-opab 5179 df-mpt 5199 df-cnv 5659 df-iota 6480 df-fv 6535 |
| This theorem is referenced by: tendoi 40734 |
| Copyright terms: Public domain | W3C validator |