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

Theorem diagval 17482
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 17458 . . . 4 Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))
32a1i 11 . . 3 (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))))
4 simprl 769 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑐 = 𝐶)
5 simprr 771 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑑 = 𝐷)
64, 5opeq12d 4803 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩)
74, 5oveq12d 7166 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷))
86, 7oveq12d 7166 . . 3 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
9 diagval.c . . 3 (𝜑𝐶 ∈ Cat)
10 diagval.d . . 3 (𝜑𝐷 ∈ Cat)
11 ovexd 7183 . . 3 (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V)
123, 8, 9, 10, 11ovmpod 7294 . 2 (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
131, 12syl5eq 2866 1 (𝜑𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1530  wcel 2107  Vcvv 3493  cop 4565  (class class class)co 7148  cmpo 7150  Catccat 16927   1stF c1stf 17411   curryF ccurf 17452  Δfunccdiag 17454
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pr 5320
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-diag 17458
This theorem is referenced by:  diagcl  17483  diag11  17485  diag12  17486  diag2  17487
  Copyright terms: Public domain W3C validator