Theorem setcval 18042

Description: Value of the category of sets (in a universe). (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
setcval.c	⊢ 𝐶 = (SetCat‘𝑈)
setcval.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
setcval.h	⊢ (𝜑 → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
setcval.o	⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))

Assertion

Ref	Expression
setcval	⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

Distinct variable groups:   𝑓,𝑔,𝑣,𝑥,𝑦,𝑧   𝜑,𝑣,𝑥,𝑦,𝑧   𝑣,𝑈,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑓,𝑔)   𝐶(𝑥,𝑦,𝑧,𝑣,𝑓,𝑔)   · (𝑥,𝑦,𝑧,𝑣,𝑓,𝑔)   𝑈(𝑓,𝑔)   𝐻(𝑥,𝑦,𝑧,𝑣,𝑓,𝑔)   𝑉(𝑥,𝑦,𝑧,𝑣,𝑓,𝑔)

Proof of Theorem setcval

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		setcval.c	. 2 ⊢ 𝐶 = (SetCat‘𝑈)
2		df-setc 18041	. . 3 ⊢ SetCat = (𝑢 ∈ V ↦ {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
3		simpr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
4	3	opeq2d 4818	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Base‘ndx), 𝑢⟩ = ⟨(Base‘ndx), 𝑈⟩)
5		eqidd 2741	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑦 ↑m 𝑥) = (𝑦 ↑m 𝑥))
6	3, 3, 5	mpoeq123dv 7438	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
7		setcval.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
8	7	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
9	6, 8	eqtr4d 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = 𝐻)
10	9	opeq2d 4818	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩ = ⟨(Hom ‘ndx), 𝐻⟩)
11	3	sqxpeqd 5657	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑢 × 𝑢) = (𝑈 × 𝑈))
12		eqidd 2741	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)) = (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))
13	11, 3, 12	mpoeq123dv 7438	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
14		setcval.o	. . . . . . 7 ⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
15	14	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
16	13, 15	eqtr4d 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = · )
17	16	opeq2d 4818	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩ = ⟨(comp‘ndx), · ⟩)
18	4, 10, 17	tpeq123d 4687	. . 3 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
19		setcval.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
20	19	elexd 3456	. . 3 ⊢ (𝜑 → 𝑈 ∈ V)
21		tpex 7696	. . . 4 ⊢ {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩} ∈ V
22	21	a1i 11	. . 3 ⊢ (𝜑 → {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩} ∈ V)
23	2, 18, 20, 22	fvmptd2 6951	. 2 ⊢ (𝜑 → (SetCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
24	1, 23	eqtrid 2787	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  Vcvv 3432  {ctp 4566  ⟨cop 4568   × cxp 5623   ∘ ccom 5629  ‘cfv 6492  (class class class)co 7363   ∈ cmpo 7365  1^st c1st 7936  2^nd c2nd 7937   ↑_m cmap 8770  ndxcnx 17161  Basecbs 17177  Hom chom 17229  compcco 17230  SetCatcsetc 18040

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-oprab 7367  df-mpo 7368  df-setc 18041

This theorem is referenced by:  setcbas  18043  setchomfval  18044  setccofval  18047