Theorem natffn 18134

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

This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450  ⦋csb 3847  ⟨cop 4834   × cxp 5648   Fn wfn 6536  ‘cfv 6541  (class class class)co 7422  1^st c1st 8001  2^nd c2nd 8002  Xcixp 8930  Basecbs 17394  Hom chom 17446  compcco 17447   Func cfunc 18036   Nat cnat 18126

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 7753

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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  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-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-1st 8003  df-2nd 8004  df-ixp 8931  df-func 18040  df-nat 18128

This theorem is used by:  fuchom  18146