Theorem natffn 17975

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 2761	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
3		eqid 2761	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
4		eqid 2761	. . 3 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
5		eqid 2761	. . 3 ⊢ (comp‘𝐷) = (comp‘𝐷)
6	1, 2, 3, 4, 5	natfval 17972	. 2 ⊢ 𝑁 = (𝑓 ∈ (𝐶 Func 𝐷), 𝑔 ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))})
7		ovex 7423	. . . . . . 7 ⊢ ((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
8	7	rgenw 3079	. . . . . 6 ⊢ ∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
9		ixpexg 8897	. . . . . 6 ⊢ (∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V → X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V)
10	8, 9	ax-mp 5	. . . . 5 ⊢ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V
11	10	rabex 5292	. . . 4 ⊢ {𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
12	11	csbex 5258	. . 3 ⊢ ⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
13	12	csbex 5258	. 2 ⊢ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(⟨(𝑟‘𝑥), (𝑟‘𝑦)⟩(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(⟨(𝑟‘𝑥), (𝑠‘𝑥)⟩(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V
14	6, 13	fnmpoi 8045	1 ⊢ 𝑁 Fn ((𝐶 Func 𝐷) × (𝐶 Func 𝐷))

Syntax hints:   = wceq 1559   ∈ wcel 2141  ∀wral 3075  {crab 3413  Vcvv 3453  ⦋csb 3850  ⟨cop 4585   × cxp 5641   Fn wfn 6510  ‘cfv 6515  (class class class)co 7390  1^st c1st 7962  2^nd c2nd 7963  Xcixp 8872  Basecbs 17235  Hom chom 17287  compcco 17288   Func cfunc 17877   Nat cnat 17967

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-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712

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-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7964  df-2nd 7965  df-ixp 8873  df-func 17881  df-nat 17969

This theorem is referenced by:  fuchom  17987