Theorem natffn 17581

Description: The natural transformation set operation is a well-defined function. (Contributed by Mario Carneiro, 12-Jan-2017.)

Hypothesis

Ref	Expression
natrcl.1	⊢ 𝑁 = (𝐶 Nat 𝐷)

Assertion

Ref	Expression
natffn	⊢ 𝑁 Fn ((𝐶 Func 𝐷) × (𝐶 Func 𝐷))

Proof of Theorem natffn

Dummy variables 𝑥 𝑓 𝑦 𝑎 𝑔 ℎ 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		natrcl.1	. . 3 ⊢ 𝑁 = (𝐶 Nat 𝐷)
2		eqid 2738	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2738	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
4		eqid 2738	. . 3 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
5		eqid 2738	. . 3 ⊢ (comp‘𝐷) = (comp‘𝐷)
6	1, 2, 3, 4, 5	natfval 17578	. 2 ⊢ 𝑁 = (𝑓 ∈ (𝐶 Func 𝐷), 𝑔 ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))})
7		ovex 7288	. . . . . . 7 ⊢ ((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
8	7	rgenw 3075	. . . . . 6 ⊢ ∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
9		ixpexg 8668	. . . . . 6 ⊢ (∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V → X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V)
10	8, 9	ax-mp 5	. . . . 5 ⊢ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
11	10	rabex 5251	. . . 4 ⊢ {𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
12	11	csbex 5230	. . 3 ⊢ ⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
13	12	csbex 5230	. 2 ⊢ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
14	6, 13	fnmpoi 7883	1 ⊢ 𝑁 Fn ((𝐶 Func 𝐷) × (𝐶 Func 𝐷))

Syntax hints:   = wceq 1539   ∈ wcel 2108  ∀wral 3063  {crab 3067  Vcvv 3422  ⦋csb 3828  ⟨cop 4564   × cxp 5578   Fn wfn 6413  ‘cfv 6418  (class class class)co 7255  1^st c1st 7802  2^nd c2nd 7803  Xcixp 8643  Basecbs 16840  Hom chom 16899  compcco 16900   Func cfunc 17485   Nat cnat 17573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-ixp 8644  df-func 17489  df-nat 17575

This theorem is referenced by:  fuchom  17594  fuchomOLD  17595