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

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

Proof of Theorem catidex
Dummy variables 𝑘 𝑤 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 22 . . . 4 (𝑥 = 𝑋𝑥 = 𝑋)
21, 1oveq12d 7408 . . 3 (𝑥 = 𝑋 → (𝑥𝐻𝑥) = (𝑋𝐻𝑋))
3 oveq2 7398 . . . . . 6 (𝑥 = 𝑋 → (𝑦𝐻𝑥) = (𝑦𝐻𝑋))
4 opeq2 4829 . . . . . . . . 9 (𝑥 = 𝑋 → ⟨𝑦, 𝑥⟩ = ⟨𝑦, 𝑋⟩)
54, 1oveq12d 7408 . . . . . . . 8 (𝑥 = 𝑋 → (⟨𝑦, 𝑥· 𝑥) = (⟨𝑦, 𝑋· 𝑋))
65oveqd 7407 . . . . . . 7 (𝑥 = 𝑋 → (𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = (𝑔(⟨𝑦, 𝑋· 𝑋)𝑓))
76eqeq1d 2763 . . . . . 6 (𝑥 = 𝑋 → ((𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ↔ (𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓))
83, 7raleqbidv 3335 . . . . 5 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ↔ ∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓))
9 oveq1 7397 . . . . . 6 (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
101, 1opeq12d 4836 . . . . . . . . 9 (𝑥 = 𝑋 → ⟨𝑥, 𝑥⟩ = ⟨𝑋, 𝑋⟩)
1110oveq1d 7405 . . . . . . . 8 (𝑥 = 𝑋 → (⟨𝑥, 𝑥· 𝑦) = (⟨𝑋, 𝑋· 𝑦))
1211oveqd 7407 . . . . . . 7 (𝑥 = 𝑋 → (𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = (𝑓(⟨𝑋, 𝑋· 𝑦)𝑔))
1312eqeq1d 2763 . . . . . 6 (𝑥 = 𝑋 → ((𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓 ↔ (𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
149, 13raleqbidv 3335 . . . . 5 (𝑥 = 𝑋 → (∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓 ↔ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
158, 14anbi12d 641 . . . 4 (𝑥 = 𝑋 → ((∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ↔ (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓)))
1615ralbidv 3184 . . 3 (𝑥 = 𝑋 → (∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ↔ ∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓)))
172, 16rexeqbidv 3336 . 2 (𝑥 = 𝑋 → (∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ↔ ∃𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓)))
18 catidex.c . . 3 (𝜑𝐶 ∈ Cat)
19 catidex.b . . . . 5 𝐵 = (Base‘𝐶)
20 catidex.h . . . . 5 𝐻 = (Hom ‘𝐶)
21 catidex.o . . . . 5 · = (comp‘𝐶)
2219, 20, 21iscat 17694 . . . 4 (𝐶 ∈ Cat → (𝐶 ∈ Cat ↔ ∀𝑥𝐵 (∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ∧ ∀𝑦𝐵𝑧𝐵𝑓 ∈ (𝑥𝐻𝑦)∀𝑔 ∈ (𝑦𝐻𝑧)((𝑔(⟨𝑥, 𝑦· 𝑧)𝑓) ∈ (𝑥𝐻𝑧) ∧ ∀𝑤𝐵𝑘 ∈ (𝑧𝐻𝑤)((𝑘(⟨𝑦, 𝑧· 𝑤)𝑔)(⟨𝑥, 𝑦· 𝑤)𝑓) = (𝑘(⟨𝑥, 𝑧· 𝑤)(𝑔(⟨𝑥, 𝑦· 𝑧)𝑓))))))
2322ibi 269 . . 3 (𝐶 ∈ Cat → ∀𝑥𝐵 (∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ∧ ∀𝑦𝐵𝑧𝐵𝑓 ∈ (𝑥𝐻𝑦)∀𝑔 ∈ (𝑦𝐻𝑧)((𝑔(⟨𝑥, 𝑦· 𝑧)𝑓) ∈ (𝑥𝐻𝑧) ∧ ∀𝑤𝐵𝑘 ∈ (𝑧𝐻𝑤)((𝑘(⟨𝑦, 𝑧· 𝑤)𝑔)(⟨𝑥, 𝑦· 𝑤)𝑓) = (𝑘(⟨𝑥, 𝑧· 𝑤)(𝑔(⟨𝑥, 𝑦· 𝑧)𝑓)))))
24 simpl 486 . . . 4 ((∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ∧ ∀𝑦𝐵𝑧𝐵𝑓 ∈ (𝑥𝐻𝑦)∀𝑔 ∈ (𝑦𝐻𝑧)((𝑔(⟨𝑥, 𝑦· 𝑧)𝑓) ∈ (𝑥𝐻𝑧) ∧ ∀𝑤𝐵𝑘 ∈ (𝑧𝐻𝑤)((𝑘(⟨𝑦, 𝑧· 𝑤)𝑔)(⟨𝑥, 𝑦· 𝑤)𝑓) = (𝑘(⟨𝑥, 𝑧· 𝑤)(𝑔(⟨𝑥, 𝑦· 𝑧)𝑓)))) → ∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))
2524ralimi 3098 . . 3 (∀𝑥𝐵 (∃𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓) ∧ ∀𝑦𝐵𝑧𝐵𝑓 ∈ (𝑥𝐻𝑦)∀𝑔 ∈ (𝑦𝐻𝑧)((𝑔(⟨𝑥, 𝑦· 𝑧)𝑓) ∈ (𝑥𝐻𝑧) ∧ ∀𝑤𝐵𝑘 ∈ (𝑧𝐻𝑤)((𝑘(⟨𝑦, 𝑧· 𝑤)𝑔)(⟨𝑥, 𝑦· 𝑤)𝑓) = (𝑘(⟨𝑥, 𝑧· 𝑤)(𝑔(⟨𝑥, 𝑦· 𝑧)𝑓)))) → ∀𝑥𝐵𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))
2618, 23, 253syl 18 . 2 (𝜑 → ∀𝑥𝐵𝑔 ∈ (𝑥𝐻𝑥)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑥)(𝑔(⟨𝑦, 𝑥· 𝑥)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑥𝐻𝑦)(𝑓(⟨𝑥, 𝑥· 𝑦)𝑔) = 𝑓))
27 catidex.x . 2 (𝜑𝑋𝐵)
2817, 26, 27rspcdva 3581 1 (𝜑 → ∃𝑔 ∈ (𝑋𝐻𝑋)∀𝑦𝐵 (∀𝑓 ∈ (𝑦𝐻𝑋)(𝑔(⟨𝑦, 𝑋· 𝑋)𝑓) = 𝑓 ∧ ∀𝑓 ∈ (𝑋𝐻𝑦)(𝑓(⟨𝑋, 𝑋· 𝑦)𝑔) = 𝑓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  cop 4585  cfv 6515  (class class class)co 7390  Basecbs 17235  Hom chom 17287  compcco 17288  Catccat 17686
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-nul 5253
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-iota 6471  df-fv 6523  df-ov 7393  df-cat 17690
This theorem is referenced by:  catideu  17697
  Copyright terms: Public domain W3C validator