Theorem setcval 18232

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 18231	. . 3 ⊢ SetCat = (𝑢 ∈ V ↦ {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
3		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝑢 = 𝑈)
4	3	opeq2d 4840	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Base‘ndx), 𝑢⟩ = ⟨(Base‘ndx), 𝑈⟩)
5		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑦 ↑m 𝑥) = (𝑦 ↑m 𝑥))
6	3, 3, 5	mpoeq123dv 7487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
7		setcval.h	. . . . . . 7 ⊢ (𝜑 → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
8	7	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → 𝐻 = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
9	6, 8	eqtr4d 2799	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥)) = 𝐻)
10	9	opeq2d 4840	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(Hom ‘ndx), (𝑥 ∈ 𝑢, 𝑦 ∈ 𝑢 ↦ (𝑦 ↑m 𝑥))⟩ = ⟨(Hom ‘ndx), 𝐻⟩)
11	3	sqxpeqd 5683	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑢 × 𝑢) = (𝑈 × 𝑈))
12		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)) = (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))
13	11, 3, 12	mpoeq123dv 7487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
14		setcval.o	. . . . . . 7 ⊢ (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
15	14	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
16	13, 15	eqtr4d 2799	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = · )
17	16	opeq2d 4840	. . . 4 ⊢ ((𝜑 ∧ 𝑢 = 𝑈) → ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧 ∈ 𝑢 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩ = ⟨(comp‘ndx), · ⟩)
18	4, 10, 17	tpeq123d 4709	. . 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 3474	. . 3 ⊢ (𝜑 → 𝑈 ∈ V)
21		tpex 7751	. . . 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 6994	. 2 ⊢ (𝜑 → (SetCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
24	1, 23	eqtrid 2808	1 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {ctp 4588  ⟨cop 4590   × cxp 5649   ∘ ccom 5655  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  1^st c1st 7988  2^nd c2nd 7989   ↑_m cmap 8831  ndxcnx 17351  Basecbs 17367  Hom chom 17419  compcco 17420  SetCatcsetc 18230

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-oprab 7416  df-mpo 7417  df-setc 18231

This theorem is used by:  setcbas  18233  setchomfval  18234  setccofval  18237