| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > diagval | Structured version Visualization version GIF version | ||
| Description: Define the diagonal functor, which is the functor 𝐶⟶(𝐷 Func 𝐶) whose object part is 𝑥 ∈ 𝐶 ↦ (𝑦 ∈ 𝐷 ↦ 𝑥). We can define this equationally as the currying of the first projection functor, and by expressing it this way we get a quick proof of functoriality. (Contributed by Mario Carneiro, 6-Jan-2017.) (Revised by Mario Carneiro, 15-Jan-2017.) |
| Ref | Expression |
|---|---|
| diagval.l | ⊢ 𝐿 = (𝐶Δfunc𝐷) |
| diagval.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| diagval.d | ⊢ (𝜑 → 𝐷 ∈ Cat) |
| Ref | Expression |
|---|---|
| diagval | ⊢ (𝜑 → 𝐿 = (〈𝐶, 𝐷〉 curryF (𝐶 1stF 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | diagval.l | . 2 ⊢ 𝐿 = (𝐶Δfunc𝐷) | |
| 2 | df-diag 18422 | . . . 4 ⊢ Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (〈𝑐, 𝑑〉 curryF (𝑐 1stF 𝑑))) | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (〈𝑐, 𝑑〉 curryF (𝑐 1stF 𝑑)))) |
| 4 | simprl 783 | . . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑐 = 𝐶) | |
| 5 | simprr 785 | . . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑑 = 𝐷) | |
| 6 | 4, 5 | opeq12d 4851 | . . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 〈𝑐, 𝑑〉 = 〈𝐶, 𝐷〉) |
| 7 | 4, 5 | oveq12d 7464 | . . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷)) |
| 8 | 6, 7 | oveq12d 7464 | . . 3 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (〈𝑐, 𝑑〉 curryF (𝑐 1stF 𝑑)) = (〈𝐶, 𝐷〉 curryF (𝐶 1stF 𝐷))) |
| 9 | diagval.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 10 | diagval.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
| 11 | ovexd 7481 | . . 3 ⊢ (𝜑 → (〈𝐶, 𝐷〉 curryF (𝐶 1stF 𝐷)) ∈ V) | |
| 12 | 3, 8, 9, 10, 11 | ovmpod 7599 | . 2 ⊢ (𝜑 → (𝐶Δfunc𝐷) = (〈𝐶, 𝐷〉 curryF (𝐶 1stF 𝐷))) |
| 13 | 1, 12 | eqtrid 2810 | 1 ⊢ (𝜑 → 𝐿 = (〈𝐶, 𝐷〉 curryF (𝐶 1stF 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 〈cop 4838 (class class class)co 7446 ∈ cmpo 7448 Catccat 17870 1stF c1stf 18375 curryF ccurf 18416 Δfunccdiag 18418 |
| 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-sep 5253 ax-nul 5264 ax-pr 5396 |
| 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-rab 3417 df-v 3456 df-sbc 3743 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 4839 df-uni 4871 df-br 5107 df-opab 5172 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-iota 6515 df-fun 6563 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-diag 18422 |
| This theorem is used by: diagcl 18447 diag11 18449 diag12 18450 diag2 18451 diagpropd 50629 |
| Copyright terms: Public domain | W3C validator |