| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > idafval | Structured version Visualization version GIF version | ||
| Description: Value of the identity arrow function. (Contributed by Mario Carneiro, 11-Jan-2017.) |
| Ref | Expression |
|---|---|
| idafval.i | ⊢ 𝐼 = (Ida‘𝐶) |
| idafval.b | ⊢ 𝐵 = (Base‘𝐶) |
| idafval.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| idafval.1 | ⊢ 1 = (Id‘𝐶) |
| Ref | Expression |
|---|---|
| idafval | ⊢ (𝜑 → 𝐼 = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | idafval.i | . 2 ⊢ 𝐼 = (Ida‘𝐶) | |
| 2 | idafval.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 3 | fveq2 6916 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶)) | |
| 4 | idafval.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | 3, 4 | eqtr4di 2816 | . . . . 5 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵) |
| 6 | fveq2 6916 | . . . . . . . 8 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = (Id‘𝐶)) | |
| 7 | idafval.1 | . . . . . . . 8 ⊢ 1 = (Id‘𝐶) | |
| 8 | 6, 7 | eqtr4di 2816 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = 1 ) |
| 9 | 8 | fveq1d 6918 | . . . . . 6 ⊢ (𝑐 = 𝐶 → ((Id‘𝑐)‘𝑥) = ( 1 ‘𝑥)) |
| 10 | 9 | oteq3d 4870 | . . . . 5 ⊢ (𝑐 = 𝐶 → 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉 = 〈𝑥, 𝑥, ( 1 ‘𝑥)〉) |
| 11 | 5, 10 | mpteq12dv 5198 | . . . 4 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 12 | df-ida 18280 | . . . 4 ⊢ Ida = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉)) | |
| 13 | 11, 12, 4 | mptfvmpt 7265 | . . 3 ⊢ (𝐶 ∈ Cat → (Ida‘𝐶) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 14 | 2, 13 | syl 18 | . 2 ⊢ (𝜑 → (Ida‘𝐶) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 15 | 1, 14 | eqtrid 2810 | 1 ⊢ (𝜑 → 𝐼 = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 〈cotp 4863 ↦ cmpt 5192 ‘cfv 6566 Basecbs 17431 Catccat 17888 Idccid 17889 Idacida 18278 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| 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-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-ot 4864 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ida 18280 |
| This theorem is used by: idaval 18283 idaf 18288 |
| Copyright terms: Public domain | W3C validator |