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

Theorem diagval 18321
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 18297 . . . 4 Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))
32a1i 11 . . 3 (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))))
4 simprl 783 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑐 = 𝐶)
5 simprr 785 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑑 = 𝐷)
64, 5opeq12d 4851 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩)
74, 5oveq12d 7441 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷))
86, 7oveq12d 7441 . . 3 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
9 diagval.c . . 3 (𝜑𝐶 ∈ Cat)
10 diagval.d . . 3 (𝜑𝐷 ∈ Cat)
11 ovexd 7458 . . 3 (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V)
123, 8, 9, 10, 11ovmpod 7575 . 2 (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
131, 12eqtrid 2813 1 (𝜑𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  Vcvv 3458  cop 4600  (class class class)co 7423  cmpo 7425  Catccat 17745   1stF c1stf 18250   curryF ccurf 18291  Δfunccdiag 18293
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-diag 18297
This theorem is used by:  diagcl  18322  diag11  18324  diag12  18325  diag2  18326  diagpropd  50111
  Copyright terms: Public domain W3C validator