Theorem setcval 18001

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 18000	. . 3 ⊢ SetCat = (𝑢 ∈ V ↦ {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
3		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
4	3	opeq2d 4836	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Base‘ndx), 𝑢⟩ = ⟨(Base‘ndx), 𝑈⟩)
5		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑦 ↑m 𝑥) = (𝑦 ↑m 𝑥))
6	3, 3, 5	mpoeq123dv 7433	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
7		setcval.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
8	7	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
9	6, 8	eqtr4d 2774	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = 𝐻)
10	9	opeq2d 4836	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩ = ⟨(Hom ‘ndx), 𝐻⟩)
11	3	sqxpeqd 5656	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑢 × 𝑢) = (𝑈 × 𝑈))
12		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)) = (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))
13	11, 3, 12	mpoeq123dv 7433	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
14		setcval.o	. . . . . . 7 ⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
15	14	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
16	13, 15	eqtr4d 2774	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = · )
17	16	opeq2d 4836	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩ = ⟨(comp‘ndx), · ⟩)
18	4, 10, 17	tpeq123d 4705	. . 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 3464	. . 3 ⊢ (𝜑 → 𝑈 ∈ V)
21		tpex 7691	. . . 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 6949	. 2 ⊢ (𝜑 → (SetCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
24	1, 23	eqtrid 2783	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3440  {ctp 4584  ⟨cop 4586   × cxp 5622   ∘ ccom 5628  ‘cfv 6492  (class class class)co 7358   ∈ cmpo 7360  1^st c1st 7931  2^nd c2nd 7932   ↑_m cmap 8763  ndxcnx 17120  Basecbs 17136  Hom chom 17188  compcco 17189  SetCatcsetc 17999

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-oprab 7362  df-mpo 7363  df-setc 18000

This theorem is referenced by:  setcbas  18002  setchomfval  18003  setccofval  18006