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 2776 . 2 (𝑥 = 𝑋 → (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ↔ ((𝑋𝐺𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝐹‘𝑋))))
7 funcid.f . . . . 5 (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺)
8 funcid.b . . . . . 6 𝐵 = (Base‘𝐷)
9 eqid 2760 . . . . . 6 (Base‘𝐸) = (Base‘𝐸)
10 eqid 2760 . . . . . 6 (Hom ‘𝐷) = (Hom ‘𝐷)
11 eqid 2760 . . . . . 6 (Hom ‘𝐸) = (Hom ‘𝐸)
12 funcid.1 . . . . . 6 1 = (Id‘𝐷)
13 funcid.i . . . . . 6 𝐼 = (Id‘𝐸)
14 eqid 2760 . . . . . 6 (comp‘𝐷) = (comp‘𝐷)
15 eqid 2760 . . . . . 6 (comp‘𝐸) = (comp‘𝐸)
16 df-br 5103 . . . . . . . . 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 3099 . . 3 (∀𝑥 ∈ 𝐵 (((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)) ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑚 ∈ (𝑥(Hom ‘𝐷)𝑦)∀𝑛 ∈ (𝑦(Hom ‘𝐷)𝑧)((𝑥𝐺𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑚)) = (((𝑦𝐺𝑧)‘𝑛)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐸)(𝐹‘𝑧))((𝑥𝐺𝑦)‘𝑚))) → ∀𝑥 ∈ 𝐵 ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
2724, 26syl 18 . 2 (𝜑 → ∀𝑥 ∈ 𝐵 ((𝑥𝐺𝑥)‘( 1 ‘𝑥)) = (𝐼‘(𝐹‘𝑥)))
28 funcid.x . 2 (𝜑 → 𝑋 ∈ 𝐵)
296, 27, 28rspcdva 3577 1 (𝜑 → ((𝑋𝐺𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝐹‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟨cop 4589   class class class wbr 5102   × cxp 5648  ⟶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 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  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  50305  upciclem3  50319  fucoid  50499  fucorid  50513  precofvallem  50517  termcfuncval  50683
  Copyright terms: Public domain W3C validator