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

Theorem funcid 18045
Description: A functor maps each identity to the corresponding identity in the target category. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
funcid.b 𝐵 = (Base‘𝐷)
funcid.1 1 = (Id‘𝐷)
funcid.i 𝐼 = (Id‘𝐸)
funcid.f (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
funcid.x (𝜑 → 𝑋 ∈ 𝐵)
Assertion
Ref Expression
funcid (𝜑 → ((𝑋𝐺𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝐹‘𝑋)))

Proof of Theorem funcid
Dummy variables 𝑚 𝑛 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 id 23 . . . . 5 (𝑥 = 𝑋 → 𝑥 = 𝑋)
21, 1oveq12d 7438 . . . 4 (𝑥 = 𝑋 → (𝑥𝐺𝑥) = (𝑋𝐺𝑋))
3 fveq2 6885 . . . 4 (𝑥 = 𝑋 → ( 1 ‘𝑥) = ( 1 ‘𝑋))
42, 3fveq12d 6892 . . 3 (𝑥 = 𝑋 → ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = ((𝑋𝐺𝑋)‘( 1 ‘𝑋)))
5 2fveq3 6890 . . 3 (𝑥 = 𝑋 → (𝐼‘(𝐹‘𝑥)) = (𝐼‘(𝐹‘𝑋)))
64, 5eqeq12d 2777 . 2 (𝑥 = 𝑋 → (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ↔ ((𝑋𝐺𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝐹‘𝑋))))
7 funcid.f . . . . 5 (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
8 funcid.b . . . . . 6 𝐵 = (Base‘𝐷)
9 eqid 2761 . . . . . 6 (Base‘𝐸) = (Base‘𝐸)
10 eqid 2761 . . . . . 6 (Hom ‘𝐷) = (Hom ‘𝐷)
11 eqid 2761 . . . . . 6 (Hom ‘𝐸) = (Hom ‘𝐸)
12 funcid.1 . . . . . 6 1 = (Id‘𝐷)
13 funcid.i . . . . . 6 𝐼 = (Id‘𝐸)
14 eqid 2761 . . . . . 6 (comp‘𝐷) = (comp‘𝐷)
15 eqid 2761 . . . . . 6 (comp‘𝐸) = (comp‘𝐸)
16 df-br 5104 . . . . . . . . 9 (𝐹(𝐷 Func 𝐸)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
177, 16sylib 221 . . . . . . . 8 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸))
18 funcrcl 18038 . . . . . . . 8 (⟨𝐹, 𝐺⟩ ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
1917, 18syl 18 . . . . . . 7 (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat))
2019simpld 500 . . . . . 6 (𝜑 → 𝐷 ∈ Cat)
2119simprd 501 . . . . . 6 (𝜑 → 𝐸 ∈ Cat)
228, 9, 10, 11, 12, 13, 14, 15, 20, 21isfunc 18039 . . . . 5 (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))(Hom ‘𝐸)(𝐹‘(2nd ‘𝑧))) ↑m ((Hom ‘𝐷)‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))))))
237, 22mpbid 235 . . . 4 (𝜑 → (𝐹:𝐵⟶(Base‘𝐸) ∧ 𝐺 ∈ X𝑧 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑧))(Hom ‘𝐸)(𝐹‘(2nd ‘𝑧))) ↑m ((Hom ‘𝐷)‘𝑧)) ∧ ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚)))))
2423simp3d 1162 . . 3 (𝜑 → ∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))))
25 simpl 488 . . . 4 ((((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))) → ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
2625ralimi 3100 . . 3 (∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))) → ∀𝑥 ∈ 𝐵 ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
2724, 26syl 18 . 2 (𝜑 → ∀𝑥 ∈ 𝐵 ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
28 funcid.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
296, 27, 28rspcdva 3578 1 (𝜑 → ((𝑋𝐺𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝐹‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ⟨cop 4590   class class class wbr 5103   × cxp 5649  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  1st c1st 7999  2nd c2nd 8000   ↑m cmap 8847  Xcixp 8925  Basecbs 17387  Hom chom 17439  compcco 17440  Catccat 17838  Idccid 17839   Func cfunc 18029
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-pow 5327  ax-pr 5391  ax-un 7751
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-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-pw 4559  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-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-ixp 8926  df-func 18033
This theorem is used by:  funcsect  18047  funcoppc  18050  cofucl  18063  funcres  18071  fthsect  18102  catcisolem  18285  prfcl  18377  evlfcl  18396  curf1cl  18402  curfcl  18406  curfuncf  18412  yonedainv  18455  imaid  50261  upciclem3  50275  fucoid  50455  fucorid  50469  precofvallem  50473  termcfuncval  50639
  Copyright terms: Public domain W3C validator