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

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

Proof of Theorem cidval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 cidfval.b . . 3 𝐵 = (Base‘𝐶)
2 cidfval.h . . 3 𝐻 = (Hom ‘𝐶)
3 cidfval.o . . 3 · = (comp‘𝐶)
4 cidfval.c . . 3 (𝜑 → 𝐶 ∈ Cat)
5 cidfval.i . . 3 1 = (Id‘𝐶)
61, 2, 3, 4, 5cidfval 17843 . 2 (𝜑 → 1 = (𝑥 ∈ 𝐵 ↦ (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓))))
7 simpr 490 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → 𝑥 = 𝑋)
87, 7oveq12d 7436 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑥) = (𝑋𝐻𝑋))
97oveq2d 7434 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑦𝐻𝑥) = (𝑦𝐻𝑋))
107opeq2d 4840 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑦, 𝑥⟩ = ⟨𝑦, 𝑋⟩)
1110, 7oveq12d 7436 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑦, 𝑥⟩ · 𝑥) = (⟨𝑦, 𝑋⟩ · 𝑋))
1211oveqd 7435 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓))
1312eqeq1d 2763 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
149, 13raleqbidv 3335 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓))
157oveq1d 7433 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
167, 7opeq12d 4841 . . . . . . . . 9 ((𝜑 ∧ 𝑥 = 𝑋) → ⟨𝑥, 𝑥⟩ = ⟨𝑋, 𝑋⟩)
1716oveq1d 7433 . . . . . . . 8 ((𝜑 ∧ 𝑥 = 𝑋) → (⟨𝑥, 𝑥⟩ · 𝑦) = (⟨𝑋, 𝑋⟩ · 𝑦))
1817oveqd 7435 . . . . . . 7 ((𝜑 ∧ 𝑥 = 𝑋) → (𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔))
1918eqeq1d 2763 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2015, 19raleqbidv 3335 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓))
2114, 20anbi12d 644 . . . 4 ((𝜑 ∧ 𝑥 = 𝑋) → ((∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
2221ralbidv 3186 . . 3 ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓) ↔ ∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
238, 22riotaeqbidv 7378 . 2 ((𝜑 ∧ 𝑥 = 𝑋) → (℩𝑔 ∈ (𝑥𝐻𝑥)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥⟩ · 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥⟩ · 𝑦)𝑔) = 𝑓)) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
24 cidval.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
25 riotaex 7379 . . 3 (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V
2625a1i 11 . 2 (𝜑 → (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)) ∈ V)
276, 23, 24, 26fvmptd 6999 1 (𝜑 → ( 1 ‘𝑋) = (℩𝑔 ∈ (𝑋𝐻𝑋)∀𝑦 ∈ 𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋⟩ · 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋⟩ · 𝑦)𝑔) = 𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451  ⟨cop 4590  ‘cfv 6537  ℩crio 7374  (class class class)co 7418  Basecbs 17380  Hom chom 17432  compcco 17433  Catccat 17831  Idccid 17832
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-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  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-op 4591  df-uni 4868  df-iun 4953  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-rn 5662  df-res 5663  df-ima 5664  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-riota 7375  df-ov 7421  df-cid 17836
This theorem is used by:  catidcl  17849  catlid  17850  catrid  17851
  Copyright terms: Public domain W3C validator