MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  diagval Structured version   Visualization version   GIF version

Theorem diagval 18208
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.)
Hypotheses
Ref Expression
diagval.l 𝐿 = (𝐶Δfunc𝐷)
diagval.c (𝜑𝐶 ∈ Cat)
diagval.d (𝜑𝐷 ∈ Cat)
Assertion
Ref Expression
diagval (𝜑𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))

Proof of Theorem diagval
Dummy variables 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 diagval.l . 2 𝐿 = (𝐶Δfunc𝐷)
2 df-diag 18184 . . . 4 Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))
32a1i 11 . . 3 (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))))
4 simprl 770 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑐 = 𝐶)
5 simprr 772 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑑 = 𝐷)
64, 5opeq12d 4848 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩)
74, 5oveq12d 7408 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷))
86, 7oveq12d 7408 . . 3 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
9 diagval.c . . 3 (𝜑𝐶 ∈ Cat)
10 diagval.d . . 3 (𝜑𝐷 ∈ Cat)
11 ovexd 7425 . . 3 (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V)
123, 8, 9, 10, 11ovmpod 7544 . 2 (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
131, 12eqtrid 2777 1 (𝜑𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3450  cop 4598  (class class class)co 7390  cmpo 7392  Catccat 17632   1stF c1stf 18137   curryF ccurf 18178  Δfunccdiag 18180
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-iota 6467  df-fun 6516  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-diag 18184
This theorem is referenced by:  diagcl  18209  diag11  18211  diag12  18212  diag2  18213  diagpropd  49285
  Copyright terms: Public domain W3C validator