Theorem setcbas 17709

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

Hypotheses

Ref	Expression
setcbas.c	⊢ 𝐶 = (SetCat‘𝑈)
setcbas.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)

Assertion

Ref	Expression
setcbas	⊢ (𝜑 → 𝑈 = (Base‘𝐶))

Proof of Theorem setcbas

Dummy variables 𝑓 𝑔 𝑣 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		setcbas.u	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
2		catstr 17590	. . . 4 ⊢ {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} Struct ⟨1, ;15⟩
3		baseid 16843	. . . 4 ⊢ Base = Slot (Base‘ndx)
4		snsstp1 4746	. . . 4 ⊢ {⟨(Base‘ndx), 𝑈⟩} ⊆ {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}
5	2, 3, 4	strfv 16833	. . 3 ⊢ (𝑈 ∈ 𝑉 → 𝑈 = (Base‘{⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
6	1, 5	syl 17	. 2 ⊢ (𝜑 → 𝑈 = (Base‘{⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
7		setcbas.c	. . . 4 ⊢ 𝐶 = (SetCat‘𝑈)
8		eqidd 2739	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
9		eqidd 2739	. . . 4 ⊢ (𝜑 → (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
10	7, 1, 8, 9	setcval 17708	. . 3 ⊢ (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
11	10	fveq2d 6760	. 2 ⊢ (𝜑 → (Base‘𝐶) = (Base‘{⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}))
12	6, 11	eqtr4d 2781	1 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))

Syntax hints:   → wi 4   = wceq 1539   ∈ wcel 2108  {ctp 4562  ⟨cop 4564   × cxp 5578   ∘ ccom 5584  ‘cfv 6418  (class class class)co 7255   ∈ cmpo 7257  1^st c1st 7802  2^nd c2nd 7803   ↑_m cmap 8573  1c1 10803  5c5 11961  ;cdc 12366  ndxcnx 16822  Basecbs 16840  Hom chom 16899  compcco 16900  SetCatcsetc 17706

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-3 11967  df-4 11968  df-5 11969  df-6 11970  df-7 11971  df-8 11972  df-9 11973  df-n0 12164  df-z 12250  df-dec 12367  df-uz 12512  df-fz 13169  df-struct 16776  df-slot 16811  df-ndx 16823  df-base 16841  df-hom 16912  df-cco 16913  df-setc 17707

This theorem is referenced by:  setccatid  17715  setcmon  17718  setcepi  17719  setcsect  17720  setcinv  17721  setciso  17722  resssetc  17723  funcsetcres2  17724  setc2obas  17725  cat1lem  17727  funcestrcsetclem3  17775  equivestrcsetc  17785  setc1strwun  17786  funcsetcestrclem7  17794  funcsetcestrclem8  17795  funcsetcestrclem9  17796  fthsetcestrc  17798  fullsetcestrc  17799  hofcl  17893  yonedalem3a  17908  yonedalem4c  17911  yonedalem3b  17913  yonedalem3  17914  yonedainv  17915  yonffthlem  17916  funcringcsetcALTV2lem3  45484  funcringcsetclem3ALTV  45507  setcthin  46224