| 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 6893 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶)) | |
| 4 | idafval.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | 3, 4 | eqtr4di 2816 | . . . . 5 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵) |
| 6 | fveq2 6893 | . . . . . . . 8 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = (Id‘𝐶)) | |
| 7 | idafval.1 | . . . . . . . 8 ⊢ 1 = (Id‘𝐶) | |
| 8 | 6, 7 | eqtr4di 2816 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = 1 ) |
| 9 | 8 | fveq1d 6895 | . . . . . 6 ⊢ (𝑐 = 𝐶 → ((Id‘𝑐)‘𝑥) = ( 1 ‘𝑥)) |
| 10 | 9 | oteq3d 4867 | . . . . 5 ⊢ (𝑐 = 𝐶 → 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉 = 〈𝑥, 𝑥, ( 1 ‘𝑥)〉) |
| 11 | 5, 10 | mpteq12dv 5194 | . . . 4 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 12 | df-ida 18242 | . . . 4 ⊢ Ida = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉)) | |
| 13 | 11, 12, 4 | mptfvmpt 7241 | . . 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 1569 ∈ wcel 2146 〈cotp 4860 ↦ cmpt 5188 ‘cfv 6546 Basecbs 17399 Catccat 17850 Idccid 17851 Idacida 18240 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 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 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-ot 4861 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ida 18242 |
| This theorem is used by: idaval 18245 idaf 18250 |
| Copyright terms: Public domain | W3C validator |