| 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 6879 | . . . . . 6 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶)) | |
| 4 | idafval.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | 3, 4 | eqtr4di 2813 | . . . . 5 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵) |
| 6 | fveq2 6879 | . . . . . . . 8 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = (Id‘𝐶)) | |
| 7 | idafval.1 | . . . . . . . 8 ⊢ 1 = (Id‘𝐶) | |
| 8 | 6, 7 | eqtr4di 2813 | . . . . . . 7 ⊢ (𝑐 = 𝐶 → (Id‘𝑐) = 1 ) |
| 9 | 8 | fveq1d 6881 | . . . . . 6 ⊢ (𝑐 = 𝐶 → ((Id‘𝑐)‘𝑥) = ( 1 ‘𝑥)) |
| 10 | 9 | oteq3d 4847 | . . . . 5 ⊢ (𝑐 = 𝐶 → 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉 = 〈𝑥, 𝑥, ( 1 ‘𝑥)〉) |
| 11 | 5, 10 | mpteq12dv 5192 | . . . 4 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 12 | df-ida 18145 | . . . 4 ⊢ Ida = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐) ↦ 〈𝑥, 𝑥, ((Id‘𝑐)‘𝑥)〉)) | |
| 13 | 11, 12, 4 | mptfvmpt 7228 | . . 3 ⊢ (𝐶 ∈ Cat → (Ida‘𝐶) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 14 | 2, 13 | syl 18 | . 2 ⊢ (𝜑 → (Ida‘𝐶) = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| 15 | 1, 14 | eqtrid 2807 | 1 ⊢ (𝜑 → 𝐼 = (𝑥 ∈ 𝐵 ↦ 〈𝑥, 𝑥, ( 1 ‘𝑥)〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 〈cotp 4592 ↦ cmpt 5186 ‘cfv 6533 Basecbs 17302 Catccat 17753 Idccid 17754 Idacida 18143 |
| 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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-ot 4593 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ida 18145 |
| This theorem is used by: idaval 18148 idaf 18153 |
| Copyright terms: Public domain | W3C validator |