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

Theorem diagval 18206
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 18182 . . . 4 Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))
32a1i 11 . . 3 (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))))
4 simprl 771 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑐 = 𝐶)
5 simprr 773 . . . . 5 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → 𝑑 = 𝐷)
64, 5opeq12d 4824 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩)
74, 5oveq12d 7385 . . . 4 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷))
86, 7oveq12d 7385 . . 3 ((𝜑 ∧ (𝑐 = 𝐶𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
9 diagval.c . . 3 (𝜑𝐶 ∈ Cat)
10 diagval.d . . 3 (𝜑𝐷 ∈ Cat)
11 ovexd 7402 . . 3 (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V)
123, 8, 9, 10, 11ovmpod 7519 . 2 (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
131, 12eqtrid 2783 1 (𝜑𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3429  cop 4573  (class class class)co 7367  cmpo 7369  Catccat 17630   1stF c1stf 18135   curryF ccurf 18176  Δfunccdiag 18178
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-diag 18182
This theorem is referenced by:  diagcl  18207  diag11  18209  diag12  18210  diag2  18211  diagpropd  49767
  Copyright terms: Public domain W3C validator