![]() |
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 18110 | . . . 4 ⊢ Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))) | |
3 | 2 | a1i 11 | . . 3 ⊢ (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))) |
4 | simprl 770 | . . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑐 = 𝐶) | |
5 | simprr 772 | . . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑑 = 𝐷) | |
6 | 4, 5 | opeq12d 4839 | . . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩) |
7 | 4, 5 | oveq12d 7376 | . . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷)) |
8 | 6, 7 | oveq12d 7376 | . . 3 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷))) |
9 | diagval.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
10 | diagval.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
11 | ovexd 7393 | . . 3 ⊢ (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V) | |
12 | 3, 8, 9, 10, 11 | ovmpod 7508 | . 2 ⊢ (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷))) |
13 | 1, 12 | eqtrid 2785 | 1 ⊢ (𝜑 → 𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 Vcvv 3444 ⟨cop 4593 (class class class)co 7358 ∈ cmpo 7360 Catccat 17549 1stF c1stf 18062 curryF ccurf 18104 Δfunccdiag 18106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5257 ax-nul 5264 ax-pr 5385 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3407 df-v 3446 df-sbc 3741 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-br 5107 df-opab 5169 df-id 5532 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-iota 6449 df-fun 6499 df-fv 6505 df-ov 7361 df-oprab 7362 df-mpo 7363 df-diag 18110 |
This theorem is referenced by: diagcl 18135 diag11 18137 diag12 18138 diag2 18139 |
Copyright terms: Public domain | W3C validator |