Theorem isnatd 49504

Description: Property of being a natural transformation; deduction form. (Contributed by Zhi Wang, 29-Sep-2025.)

Hypotheses

Ref	Expression
isnatd.1	⊢ 𝑁 = (𝐶 Nat 𝐷)
isnatd.b	⊢ 𝐵 = (Base‘𝐶)
isnatd.h	⊢ 𝐻 = (Hom ‘𝐶)
isnatd.j	⊢ 𝐽 = (Hom ‘𝐷)
isnatd.o	⊢ · = (comp‘𝐷)
isnatd.f	⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
isnatd.g	⊢ (𝜑 → 𝐾(𝐶 Func 𝐷)𝐿)
isnatd.a	⊢ (𝜑 → 𝐴 Fn 𝐵)
isnatd.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐴‘𝑥) ∈ ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))
isnatd.3	⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ ℎ ∈ (𝑥𝐻𝑦)) → ((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ · (𝐾‘𝑦))((𝑥𝐺𝑦)‘ℎ)) = (((𝑥𝐿𝑦)‘ℎ)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩ · (𝐾‘𝑦))(𝐴‘𝑥)))

Assertion

Ref	Expression
isnatd	⊢ (𝜑 → 𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩))

Distinct variable groups:   𝐴,ℎ,𝑥,𝑦   𝐵,ℎ,𝑥,𝑦   𝐶,ℎ,𝑥,𝑦   𝐷,ℎ,𝑥,𝑦   ℎ,𝐹,𝑥,𝑦   ℎ,𝐺,𝑥,𝑦   ℎ,𝐻   ℎ,𝐾,𝑥,𝑦   ℎ,𝐿,𝑥,𝑦   𝜑,ℎ,𝑥,𝑦

Allowed substitution hints:   · (𝑥,𝑦,ℎ)   𝐻(𝑥,𝑦)   𝐽(𝑥,𝑦,ℎ)   𝑁(𝑥,𝑦,ℎ)

Proof of Theorem isnatd

Step	Hyp	Ref	Expression
1		isnatd.a	. . . . 5 ⊢ (𝜑 → 𝐴 Fn 𝐵)
2		dffn5 6893	. . . . 5 ⊢ (𝐴 Fn 𝐵 ↔ 𝐴 = (𝑥 ∈ 𝐵 ↦ (𝐴‘𝑥)))
3	1, 2	sylib 218	. . . 4 ⊢ (𝜑 → 𝐴 = (𝑥 ∈ 𝐵 ↦ (𝐴‘𝑥)))
4		isnatd.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
5	4	fvexi 6849	. . . . 5 ⊢ 𝐵 ∈ V
6	5	mptex 7171	. . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐴‘𝑥)) ∈ V
7	3, 6	eqeltrdi 2845	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
8		isnatd.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐴‘𝑥) ∈ ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))
9	8	ralrimiva 3129	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐴‘𝑥) ∈ ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))
10		elixp2 8843	. . 3 ⊢ (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ↔ (𝐴 ∈ V ∧ 𝐴 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝐴‘𝑥) ∈ ((𝐹‘𝑥)𝐽(𝐾‘𝑥))))
11	7, 1, 9, 10	syl3anbrc 1345	. 2 ⊢ (𝜑 → 𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)))
12		isnatd.3	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ ℎ ∈ (𝑥𝐻𝑦)) → ((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ · (𝐾‘𝑦))((𝑥𝐺𝑦)‘ℎ)) = (((𝑥𝐿𝑦)‘ℎ)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩ · (𝐾‘𝑦))(𝐴‘𝑥)))
13	12	ralrimiva 3129	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∀ℎ ∈ (𝑥𝐻𝑦)((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ · (𝐾‘𝑦))((𝑥𝐺𝑦)‘ℎ)) = (((𝑥𝐿𝑦)‘ℎ)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩ · (𝐾‘𝑦))(𝐴‘𝑥)))
14	13	ralrimivva 3180	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀ℎ ∈ (𝑥𝐻𝑦)((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ · (𝐾‘𝑦))((𝑥𝐺𝑦)‘ℎ)) = (((𝑥𝐿𝑦)‘ℎ)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩ · (𝐾‘𝑦))(𝐴‘𝑥)))
15		isnatd.1	. . 3 ⊢ 𝑁 = (𝐶 Nat 𝐷)
16		isnatd.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
17		isnatd.j	. . 3 ⊢ 𝐽 = (Hom ‘𝐷)
18		isnatd.o	. . 3 ⊢ · = (comp‘𝐷)
19		isnatd.f	. . 3 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
20		isnatd.g	. . 3 ⊢ (𝜑 → 𝐾(𝐶 Func 𝐷)𝐿)
21	15, 4, 16, 17, 18, 19, 20	isnat 17878	. 2 ⊢ (𝜑 → (𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩) ↔ (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀ℎ ∈ (𝑥𝐻𝑦)((𝐴‘𝑦)(⟨(𝐹‘𝑥), (𝐹‘𝑦)⟩ · (𝐾‘𝑦))((𝑥𝐺𝑦)‘ℎ)) = (((𝑥𝐿𝑦)‘ℎ)(⟨(𝐹‘𝑥), (𝐾‘𝑥)⟩ · (𝐾‘𝑦))(𝐴‘𝑥)))))
22	11, 14, 21	mpbir2and 714	1 ⊢ (𝜑 → 𝐴 ∈ (⟨𝐹, 𝐺⟩𝑁⟨𝐾, 𝐿⟩))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  Vcvv 3441  ⟨cop 4587   class class class wbr 5099   ↦ cmpt 5180   Fn wfn 6488  ‘cfv 6493  (class class class)co 7360  Xcixp 8839  Basecbs 17140  Hom chom 17192  compcco 17193   Func cfunc 17782   Nat cnat 17872

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-ixp 8840  df-func 17786  df-nat 17874

This theorem is referenced by:  natoppf  49510  fuco22natlem  49626