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

Theorem sectffval 17845
Description: Value of the section operation. (Contributed by Mario Carneiro, 2-Jan-2017.) Removed redundant hypotheses. (Revised by Zhi Wang, 27-Oct-2025.)
Hypotheses
Ref Expression
issect.b 𝐵 = (Base‘𝐶)
issect.h 𝐻 = (Hom ‘𝐶)
issect.o · = (comp‘𝐶)
issect.i 1 = (Id‘𝐶)
issect.s 𝑆 = (Sect‘𝐶)
issect.c (𝜑𝐶 ∈ Cat)
Assertion
Ref Expression
sectffval (𝜑𝑆 = (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦, 1   𝑥,𝐵,𝑦   𝐶,𝑓,𝑔,𝑥,𝑦   𝜑,𝑓,𝑔,𝑥,𝑦   𝑓,𝐻,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑓, 𝑔)   𝑆(𝑥, 𝑦, 𝑓, 𝑔)

Proof of Theorem sectffval
Dummy variables 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 issect.s . 2 𝑆 = (Sect‘𝐶)
2 issect.c . . 3 (𝜑𝐶 ∈ Cat)
3 fveq2 6882 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
4 issect.b . . . . . 6 𝐵 = (Base‘𝐶)
53, 4eqtr4di 2815 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
6 fvexd 6897 . . . . . . 7 (𝑐 = 𝐶 → (Hom ‘𝑐) ∈ V)
7 fveq2 6882 . . . . . . . 8 (𝑐 = 𝐶 → (Hom ‘𝑐) = (Hom ‘𝐶))
8 issect.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
97, 8eqtr4di 2815 . . . . . . 7 (𝑐 = 𝐶 → (Hom ‘𝑐) = 𝐻)
10 simpr 490 . . . . . . . . . . 11 ((𝑐 = 𝐶 = 𝐻) → = 𝐻)
1110oveqd 7434 . . . . . . . . . 10 ((𝑐 = 𝐶 = 𝐻) → (𝑥𝑦) = (𝑥𝐻𝑦))
1211eleq2d 2848 . . . . . . . . 9 ((𝑐 = 𝐶 = 𝐻) → (𝑓 ∈ (𝑥𝑦) ↔ 𝑓 ∈ (𝑥𝐻𝑦)))
1310oveqd 7434 . . . . . . . . . 10 ((𝑐 = 𝐶 = 𝐻) → (𝑦𝑥) = (𝑦𝐻𝑥))
1413eleq2d 2848 . . . . . . . . 9 ((𝑐 = 𝐶 = 𝐻) → (𝑔 ∈ (𝑦𝑥) ↔ 𝑔 ∈ (𝑦𝐻𝑥)))
1512, 14anbi12d 644 . . . . . . . 8 ((𝑐 = 𝐶 = 𝐻) → ((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ↔ (𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥))))
16 simpl 488 . . . . . . . . . . . . 13 ((𝑐 = 𝐶 = 𝐻) → 𝑐 = 𝐶)
1716fveq2d 6886 . . . . . . . . . . . 12 ((𝑐 = 𝐶 = 𝐻) → (comp‘𝑐) = (comp‘𝐶))
18 issect.o . . . . . . . . . . . 12 · = (comp‘𝐶)
1917, 18eqtr4di 2815 . . . . . . . . . . 11 ((𝑐 = 𝐶 = 𝐻) → (comp‘𝑐) = · )
2019oveqd 7434 . . . . . . . . . 10 ((𝑐 = 𝐶 = 𝐻) → (⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥) = (⟨𝑥, 𝑦· 𝑥))
2120oveqd 7434 . . . . . . . . 9 ((𝑐 = 𝐶 = 𝐻) → (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓))
2216fveq2d 6886 . . . . . . . . . . 11 ((𝑐 = 𝐶 = 𝐻) → (Id‘𝑐) = (Id‘𝐶))
23 issect.i . . . . . . . . . . 11 1 = (Id‘𝐶)
2422, 23eqtr4di 2815 . . . . . . . . . 10 ((𝑐 = 𝐶 = 𝐻) → (Id‘𝑐) = 1 )
2524fveq1d 6884 . . . . . . . . 9 ((𝑐 = 𝐶 = 𝐻) → ((Id‘𝑐)‘𝑥) = ( 1𝑥))
2621, 25eqeq12d 2778 . . . . . . . 8 ((𝑐 = 𝐶 = 𝐻) → ((𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥) ↔ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥)))
2715, 26anbi12d 644 . . . . . . 7 ((𝑐 = 𝐶 = 𝐻) → (((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥)) ↔ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))))
286, 9, 27sbcied2 3786 . . . . . 6 (𝑐 = 𝐶 → ([(Hom ‘𝑐) / ]((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥)) ↔ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))))
2928opabbidv 5175 . . . . 5 (𝑐 = 𝐶 → {⟨𝑓, 𝑔⟩ ∣ [(Hom ‘𝑐) / ]((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥))} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))})
305, 5, 29mpoeq123dv 7492 . . . 4 (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ {⟨𝑓, 𝑔⟩ ∣ [(Hom ‘𝑐) / ]((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥))}) = (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}))
31 df-sect 17842 . . . 4 Sect = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ {⟨𝑓, 𝑔⟩ ∣ [(Hom ‘𝑐) / ]((𝑓 ∈ (𝑥𝑦) ∧ 𝑔 ∈ (𝑦𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝑐)𝑥)𝑓) = ((Id‘𝑐)‘𝑥))}))
324fvexi 6896 . . . . 5 𝐵 ∈ V
3332, 32mpoex 8082 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}) ∈ V
3430, 31, 33fvmpt 6990 . . 3 (𝐶 ∈ Cat → (Sect‘𝐶) = (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}))
352, 34syl 18 . 2 (𝜑 → (Sect‘𝐶) = (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}))
361, 35eqtrid 2809 1 (𝜑𝑆 = (𝑥𝐵, 𝑦𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥𝐻𝑦) ∧ 𝑔 ∈ (𝑦𝐻𝑥)) ∧ (𝑔(⟨𝑥, 𝑦· 𝑥)𝑓) = ( 1𝑥))}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  Vcvv 3453  [wsbc 3742  cop 4593  {copab 5171  cfv 6537  (class class class)co 7417  cmpo 7419  Basecbs 17307  Hom chom 17359  compcco 17360  Catccat 17758  Idccid 17759  Sectcsect 17839
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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-sect 17842
This theorem is used by:  sectfval  17846  sectrcl2  49957  sectfn  49963  sectpropdlem  49970
  Copyright terms: Public domain W3C validator