Theorem diagval 16703

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.

Step	Hyp	Ref	Expression
1		diagval.l	. 2 ⊢ 𝐿 = (𝐶Δfunc𝐷)
2		df-diag 16679	. . . 4 ⊢ Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)))
3	2	a1i 11	. . 3 ⊢ (𝜑 → Δfunc = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑))))
4		simprl 790	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑐 = 𝐶)
5		simprr 792	. . . . 5 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → 𝑑 = 𝐷)
6	4, 5	opeq12d 4348	. . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → ⟨𝑐, 𝑑⟩ = ⟨𝐶, 𝐷⟩)
7	4, 5	oveq12d 6567	. . . 4 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (𝑐 1stF 𝑑) = (𝐶 1stF 𝐷))
8	6, 7	oveq12d 6567	. . 3 ⊢ ((𝜑 ∧ (𝑐 = 𝐶 ∧ 𝑑 = 𝐷)) → (⟨𝑐, 𝑑⟩ curryF (𝑐 1stF 𝑑)) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
9		diagval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
10		diagval.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
11		ovex 6577	. . . 4 ⊢ (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V
12	11	a1i 11	. . 3 ⊢ (𝜑 → (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)) ∈ V)
13	3, 8, 9, 10, 12	ovmpt2d 6686	. 2 ⊢ (𝜑 → (𝐶Δfunc𝐷) = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))
14	1, 13	syl5eq 2656	1 ⊢ (𝜑 → 𝐿 = (⟨𝐶, 𝐷⟩ curryF (𝐶 1stF 𝐷)))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ⟨cop 4131  (class class class)co 6549   ↦ cmpt2 6551  Catccat 16148   1^st_F c1stf 16632   curry_F ccurf 16673  Δ_funccdiag 16675

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-diag 16679

This theorem is referenced by:  diagcl  16704  diag11  16706  diag12  16707  diag2  16708