![]() |
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-perserving 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 6351 | . . . . . 6 ⊢ (𝑠 = 𝑢 → (𝑠‘𝑓) = (𝑢‘𝑓)) | |
3 | 2 | cnveqd 5453 | . . . . 5 ⊢ (𝑠 = 𝑢 → ◡(𝑠‘𝑓) = ◡(𝑢‘𝑓)) |
4 | 3 | mpteq2dv 4897 | . . . 4 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓))) |
5 | fveq2 6352 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑢‘𝑓) = (𝑢‘𝑔)) | |
6 | 5 | cnveqd 5453 | . . . . 5 ⊢ (𝑓 = 𝑔 → ◡(𝑢‘𝑓) = ◡(𝑢‘𝑔)) |
7 | 6 | cbvmptv 4902 | . . . 4 ⊢ (𝑓 ∈ 𝑇 ↦ ◡(𝑢‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔)) |
8 | 4, 7 | syl6eq 2810 | . . 3 ⊢ (𝑠 = 𝑢 → (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓)) = (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
9 | 8 | cbvmptv 4902 | . 2 ⊢ (𝑠 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑠‘𝑓))) = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
10 | 1, 9 | eqtri 2782 | 1 ⊢ 𝐼 = (𝑢 ∈ 𝐸 ↦ (𝑔 ∈ 𝑇 ↦ ◡(𝑢‘𝑔))) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1632 ↦ cmpt 4881 ◡ccnv 5265 ‘cfv 6049 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ral 3055 df-rex 3056 df-rab 3059 df-v 3342 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-nul 4059 df-if 4231 df-sn 4322 df-pr 4324 df-op 4328 df-uni 4589 df-br 4805 df-opab 4865 df-mpt 4882 df-cnv 5274 df-iota 6012 df-fv 6057 |
This theorem is referenced by: tendoi 36584 |
Copyright terms: Public domain | W3C validator |