Theorem natixp 18047

Description: A natural transformation is a function from the objects of 𝐶 to homomorphisms from 𝐹(𝑥) to 𝐺(𝑥). (Contributed by Mario Carneiro, 6-Jan-2017.)

Hypotheses

Ref	Expression
natrcl.1	⊢ 𝑁 = (𝐶 Nat 𝐷)
natixp.2	⊢ (𝜑 → 𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩))
natixp.b	⊢ 𝐵 = (Base‘𝐶)
natixp.j	⊢ 𝐽 = (Hom ‘𝐷)

Assertion

Ref	Expression
natixp	⊢ (𝜑 → 𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝑥,𝐶   𝑥,𝐾   𝜑,𝑥   𝑥,𝐷   𝑥,𝐿   𝑥,𝐵   𝑥,𝐽

Allowed substitution hint:   𝑁(𝑥)

Proof of Theorem natixp

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		natixp.2	. . 3 ⊢ (𝜑 → 𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩))
2		natrcl.1	. . . 4 ⊢ 𝑁 = (𝐶 Nat 𝐷)
3		natixp.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
4		eqid 2760	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
5		natixp.j	. . . 4 ⊢ 𝐽 = (Hom ‘𝐷)
6		eqid 2760	. . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷)
7	2	natrcl 18045	. . . . . . 7 ⊢ (𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩) → (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) ∧ ⟨𝐾, 𝐿⟩ ∈ (𝐶 Func 𝐷)))
8	1, 7	syl 18	. . . . . 6 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) ∧ ⟨𝐾, 𝐿⟩ ∈ (𝐶 Func 𝐷)))
9	8	simpld 500	. . . . 5 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
10		df-br 5104	. . . . 5 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
11	9, 10	sylibr 237	. . . 4 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
12	8	simprd 501	. . . . 5 ⊢ (𝜑 → ⟨𝐾, 𝐿⟩ ∈ (𝐶 Func 𝐷))
13		df-br 5104	. . . . 5 ⊢ (𝐾(𝐶 Func 𝐷)𝐿 ↔ ⟨𝐾, 𝐿⟩ ∈ (𝐶 Func 𝐷))
14	12, 13	sylibr 237	. . . 4 ⊢ (𝜑 → 𝐾(𝐶 Func 𝐷)𝐿)
15	2, 3, 4, 5, 6, 11, 14	isnat 18042	. . 3 ⊢ (𝜑 → (𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩) ↔ (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥(Hom ‘𝐶)𝑦)((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐷)(𝐾‘𝑦))((𝑥𝐺𝑦)‘𝑧)) = (((𝑥𝐿𝑦)‘𝑧)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩(comp‘𝐷)(𝐾‘𝑦))(𝐴‘𝑥)))))
16	1, 15	mpbid 235	. 2 ⊢ (𝜑 → (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥(Hom ‘𝐶)𝑦)((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩(comp‘𝐷)(𝐾‘𝑦))((𝑥𝐺𝑦)‘𝑧)) = (((𝑥𝐿𝑦)‘𝑧)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩(comp‘𝐷)(𝐾‘𝑦))(𝐴‘𝑥))))
17	16	simpld 500	1 ⊢ (𝜑 → 𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ⟨cop 4590   class class class wbr 5103  ‘cfv 6533  (class class class)co 7414  Xcixp 8907  Basecbs 17304  Hom chom 17356  compcco 17357   Func cfunc 17946   Nat cnat 18036

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 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 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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-ixp 8908  df-func 17950  df-nat 18038

This theorem is used by:  natcl  18048  natfn  18049