MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  estrcval Structured version   Visualization version   GIF version

Theorem estrcval 18213
Description: Value of the category of extensible structures (in a universe). (Contributed by AV, 7-Mar-2020.)
Hypotheses
Ref Expression
estrcval.c 𝐶 = (ExtStrCat‘𝑈)
estrcval.u (𝜑𝑈𝑉)
estrcval.h (𝜑𝐻 = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
estrcval.o (𝜑· = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
Assertion
Ref Expression
estrcval (𝜑𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
Distinct variable groups:   𝑓,𝑔,𝑣,𝑥,𝑦,𝑧   𝜑,𝑣,𝑥,𝑦,𝑧   𝑣,𝑈,𝑥,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑓, 𝑔)   𝐶(𝑥, 𝑦, 𝑧, 𝑣, 𝑓, 𝑔)   · (𝑥, 𝑦, 𝑧, 𝑣, 𝑓, 𝑔)   𝑈(𝑓, 𝑔)   𝐻(𝑥, 𝑦, 𝑧, 𝑣, 𝑓, 𝑔)   𝑉(𝑥, 𝑦, 𝑧, 𝑣, 𝑓, 𝑔)

Proof of Theorem estrcval
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 estrcval.c . 2 𝐶 = (ExtStrCat‘𝑈)
2 df-estrc 18212 . . 3 ExtStrCat = (𝑢 ∈ V ↦ {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥𝑢, 𝑦𝑢 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧𝑢 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓)))⟩})
3 simpr 490 . . . . 5 ((𝜑𝑢 = 𝑈) → 𝑢 = 𝑈)
43opeq2d 4840 . . . 4 ((𝜑𝑢 = 𝑈) → ⟨(Base‘ndx), 𝑢⟩ = ⟨(Base‘ndx), 𝑈⟩)
5 eqidd 2761 . . . . . . 7 ((𝜑𝑢 = 𝑈) → ((Base‘𝑦) ↑m (Base‘𝑥)) = ((Base‘𝑦) ↑m (Base‘𝑥)))
63, 3, 5mpoeq123dv 7489 . . . . . 6 ((𝜑𝑢 = 𝑈) → (𝑥𝑢, 𝑦𝑢 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
7 estrcval.h . . . . . . 7 (𝜑𝐻 = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
87adantr 486 . . . . . 6 ((𝜑𝑢 = 𝑈) → 𝐻 = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
96, 8eqtr4d 2798 . . . . 5 ((𝜑𝑢 = 𝑈) → (𝑥𝑢, 𝑦𝑢 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = 𝐻)
109opeq2d 4840 . . . 4 ((𝜑𝑢 = 𝑈) → ⟨(Hom ‘ndx), (𝑥𝑢, 𝑦𝑢 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩ = ⟨(Hom ‘ndx), 𝐻⟩)
113sqxpeqd 5687 . . . . . . 7 ((𝜑𝑢 = 𝑈) → (𝑢 × 𝑢) = (𝑈 × 𝑈))
12 eqidd 2761 . . . . . . 7 ((𝜑𝑢 = 𝑈) → (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓)) = (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓)))
1311, 3, 12mpoeq123dv 7489 . . . . . 6 ((𝜑𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧𝑢 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
14 estrcval.o . . . . . . 7 (𝜑· = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1514adantr 486 . . . . . 6 ((𝜑𝑢 = 𝑈) → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))))
1613, 15eqtr4d 2798 . . . . 5 ((𝜑𝑢 = 𝑈) → (𝑣 ∈ (𝑢 × 𝑢), 𝑧𝑢 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓))) = · )
1716opeq2d 4840 . . . 4 ((𝜑𝑢 = 𝑈) → ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧𝑢 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓)))⟩ = ⟨(comp‘ndx), · ⟩)
184, 10, 17tpeq123d 4709 . . 3 ((𝜑𝑢 = 𝑈) → {⟨(Base‘ndx), 𝑢⟩, ⟨(Hom ‘ndx), (𝑥𝑢, 𝑦𝑢 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑢 × 𝑢), 𝑧𝑢 ↦ (𝑔 ∈ ((Base‘𝑧) ↑m (Base‘(2nd𝑣))), 𝑓 ∈ ((Base‘(2nd𝑣)) ↑m (Base‘(1st𝑣))) ↦ (𝑔𝑓)))⟩} = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
19 estrcval.u . . . 4 (𝜑𝑈𝑉)
2019elexd 3473 . . 3 (𝜑𝑈 ∈ V)
21 tpex 7748 . . . 4 {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩} ∈ V
2221a1i 11 . . 3 (𝜑 → {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩} ∈ V)
232, 18, 20, 22fvmptd2 6996 . 2 (𝜑 → (ExtStrCat‘𝑈) = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
241, 23eqtrid 2807 1 (𝜑𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), 𝐻⟩, ⟨(comp‘ndx), · ⟩})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  Vcvv 3450  {ctp 4588  cop 4590   × cxp 5653  ccom 5659  cfv 6533  (class class class)co 7414  cmpo 7416  1st c1st 7985  2nd c2nd 7986  m cmap 8827  ndxcnx 17286  Basecbs 17302  Hom chom 17354  compcco 17355  ExtStrCatcestrc 18211
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 2732  ax-sep 5251  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-oprab 7418  df-mpo 7419  df-estrc 18212
This theorem is used by:  estrcbas  18214  estrchomfval  18215  estrccofval  18218  dfrngc2  20791  dfringc2  20820
  Copyright terms: Public domain W3C validator