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

Theorem cidfval 17900
Description: Each object in a category has an associated identity arrow. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
cidfval.b 𝐵 = (Base‘𝐶)
cidfval.h 𝐻 = (Hom ‘𝐶)
cidfval.o · = (comp‘𝐶)
cidfval.c (𝜑 → 𝐶 ∈ Cat)
cidfval.i 1 = (Id‘𝐶)
Assertion
Ref Expression
cidfval (𝜑 → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
Distinct variable groups:   𝑓,𝑔,𝑥,𝑦,𝐵   𝐶,𝑓,𝑔,𝑥,𝑦   · ,𝑓,𝑔,𝑥,𝑦   𝑓,𝐻,𝑔,𝑥,𝑦   𝜑,𝑓,𝑔,𝑥,𝑦
Allowed substitution hints:   1 (𝑥, 𝑦, 𝑓, 𝑔)

Proof of Theorem cidfval
Dummy variables 𝑏 𝑐 ℎ 𝑜 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cidfval.i . 2 1 = (Id‘𝐶)
2 cidfval.c . . 3 (𝜑 → 𝐶 ∈ Cat)
3 fvexd 6931 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) ∈ V)
4 fveq2 6916 . . . . . 6 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
5 cidfval.b . . . . . 6 𝐵 = (Base‘𝐶)
64, 5eqtr4di 2816 . . . . 5 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
7 fvexd 6931 . . . . . 6 ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) ∈ V)
8 simpl 488 . . . . . . . 8 ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → 𝑐 = 𝐶)
98fveq2d 6920 . . . . . . 7 ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = (Hom ‘𝐶))
10 cidfval.h . . . . . . 7 𝐻 = (Hom ‘𝐶)
119, 10eqtr4di 2816 . . . . . 6 ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → (Hom ‘𝑐) = 𝐻)
12 fvexd 6931 . . . . . . 7 (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (comp‘𝑐) ∈ V)
13 simpll 779 . . . . . . . . 9 (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → 𝑐 = 𝐶)
1413fveq2d 6920 . . . . . . . 8 (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (comp‘𝑐) = (comp‘𝐶))
15 cidfval.o . . . . . . . 8 · = (comp‘𝐶)
1614, 15eqtr4di 2816 . . . . . . 7 (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → (comp‘𝑐) = · )
17 simpllr 788 . . . . . . . 8 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → 𝑏 = 𝐵)
18 simplr 781 . . . . . . . . . 10 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → ℎ = 𝐻)
1918oveqd 7468 . . . . . . . . 9 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑥ℎ𝑥) = (𝑥𝐻𝑥))
2018oveqd 7468 . . . . . . . . . . . 12 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑦ℎ𝑥) = (𝑦𝐻𝑥))
21 simpr 490 . . . . . . . . . . . . . . 15 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → 𝑜 = · )
2221oveqd 7468 . . . . . . . . . . . . . 14 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (⟨𝑦, 𝑥⟩𝑜𝑥) = (⟨𝑦, 𝑥⟩ · 𝑥))
2322oveqd 7468 . . . . . . . . . . . . 13 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = (𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓))
2423eqeq1d 2765 . . . . . . . . . . . 12 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → ((𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓))
2520, 24raleqbidv 3338 . . . . . . . . . . 11 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓))
2618oveqd 7468 . . . . . . . . . . . 12 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑥ℎ𝑦) = (𝑥𝐻𝑦))
2721oveqd 7468 . . . . . . . . . . . . . 14 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (⟨𝑥, 𝑥⟩𝑜𝑦) = (⟨𝑥, 𝑥⟩ · 𝑦))
2827oveqd 7468 . . . . . . . . . . . . 13 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = (𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔))
2928eqeq1d 2765 . . . . . . . . . . . 12 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → ((𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))
3026, 29raleqbidv 3338 . . . . . . . . . . 11 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))
3125, 30anbi12d 644 . . . . . . . . . 10 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → ((∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)))
3217, 31raleqbidv 3338 . . . . . . . . 9 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓) ↔ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)))
3319, 32riotaeqbidv 7411 . . . . . . . 8 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓)) = (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)))
3417, 33mpteq12dv 5198 . . . . . . 7 ((((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) ∧ 𝑜 = · ) → (𝑥 ∈ 𝑏 ↦ (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
3512, 16, 34csbied2 3888 . . . . . 6 (((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) ∧ ℎ = 𝐻) → ⦋(comp‘𝑐) / 𝑜⦌(𝑥 ∈ 𝑏 ↦ (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
367, 11, 35csbied2 3888 . . . . 5 ((𝑐 = 𝐶 ∧ 𝑏 = 𝐵) → ⦋(Hom ‘𝑐) / ℎ⦌⦋(comp‘𝑐) / 𝑜⦌(𝑥 ∈ 𝑏 ↦ (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
373, 6, 36csbied2 3888 . . . 4 (𝑐 = 𝐶 → ⦋(Base‘𝑐) / 𝑏⦌⦋(Hom ‘𝑐) / ℎ⦌⦋(comp‘𝑐) / 𝑜⦌(𝑥 ∈ 𝑏 ↦ (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓))) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
38 df-cid 17893 . . . 4 Id = (𝑐 ∈ Cat ↦ ⦋(Base‘𝑐) / 𝑏⦌⦋(Hom ‘𝑐) / ℎ⦌⦋(comp‘𝑐) / 𝑜⦌(𝑥 ∈ 𝑏 ↦ (℩𝑔 ∈ (𝑥ℎ𝑥)∀𝑦 ∈ 𝑏 (∀𝑓 ∈ (𝑦ℎ𝑥)(𝑔(⟨𝑦, 𝑥⟩𝑜𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥ℎ𝑦)(𝑓(⟨𝑥, 𝑥⟩𝑜𝑦)𝑔) = 𝑓))))
3937, 38, 5mptfvmpt 7265 . . 3 (𝐶 ∈ Cat → (Id‘𝐶) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
402, 39syl 18 . 2 (𝜑 → (Id‘𝐶) = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
411, 40eqtrid 2810 1 (𝜑 → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454  ⦋csb 3851  ⟨cop 4840   ↦ cmpt 5192  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  Hom chom 17483  compcco 17484  Catccat 17888  Idccid 17889
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-cid 17893
This theorem is used by:  cidval  17901  cidfn  17903  catidd  17904  cidpropd  17934
  Copyright terms: Public domain W3C validator