MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isnat2 Structured version   Visualization version   GIF version

Theorem isnat2 17858
Description: Property of being a natural transformation. (Contributed by Mario Carneiro, 6-Jan-2017.)
Hypotheses
Ref Expression
natfval.1 𝑁 = (𝐶 Nat 𝐷)
natfval.b 𝐵 = (Base‘𝐶)
natfval.h 𝐻 = (Hom ‘𝐶)
natfval.j 𝐽 = (Hom ‘𝐷)
natfval.o · = (comp‘𝐷)
isnat2.f (𝜑𝐹 ∈ (𝐶 Func 𝐷))
isnat2.g (𝜑𝐺 ∈ (𝐶 Func 𝐷))
Assertion
Ref Expression
isnat2 (𝜑 → (𝐴 ∈ (𝐹𝑁𝐺) ↔ (𝐴X𝑥𝐵 (((1st𝐹)‘𝑥)𝐽((1st𝐺)‘𝑥)) ∧ ∀𝑥𝐵𝑦𝐵 ∈ (𝑥𝐻𝑦)((𝐴𝑦)(⟨((1st𝐹)‘𝑥), ((1st𝐹)‘𝑦)⟩ · ((1st𝐺)‘𝑦))((𝑥(2nd𝐹)𝑦)‘)) = (((𝑥(2nd𝐺)𝑦)‘)(⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩ · ((1st𝐺)‘𝑦))(𝐴𝑥)))))
Distinct variable groups:   𝑥,,𝑦,𝐴   𝑥,𝐵,𝑦   𝐶,,𝑥,𝑦   ,𝐹,𝑥,𝑦   ,𝐺,𝑥,𝑦   ,𝐻   𝜑,,𝑥,𝑦   𝐷,,𝑥,𝑦
Allowed substitution hints:   𝐵()   · (𝑥,𝑦,)   𝐻(𝑥,𝑦)   𝐽(𝑥,𝑦,)   𝑁(𝑥,𝑦,)

Proof of Theorem isnat2
StepHypRef Expression
1 relfunc 17769 . . . . 5 Rel (𝐶 Func 𝐷)
2 isnat2.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
3 1st2nd 7971 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
41, 2, 3sylancr 587 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
5 isnat2.g . . . . 5 (𝜑𝐺 ∈ (𝐶 Func 𝐷))
6 1st2nd 7971 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → 𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
71, 5, 6sylancr 587 . . . 4 (𝜑𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
84, 7oveq12d 7364 . . 3 (𝜑 → (𝐹𝑁𝐺) = (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩))
98eleq2d 2817 . 2 (𝜑 → (𝐴 ∈ (𝐹𝑁𝐺) ↔ 𝐴 ∈ (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩)))
10 natfval.1 . . 3 𝑁 = (𝐶 Nat 𝐷)
11 natfval.b . . 3 𝐵 = (Base‘𝐶)
12 natfval.h . . 3 𝐻 = (Hom ‘𝐶)
13 natfval.j . . 3 𝐽 = (Hom ‘𝐷)
14 natfval.o . . 3 · = (comp‘𝐷)
15 1st2ndbr 7974 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
161, 2, 15sylancr 587 . . 3 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
17 1st2ndbr 7974 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
181, 5, 17sylancr 587 . . 3 (𝜑 → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
1910, 11, 12, 13, 14, 16, 18isnat 17857 . 2 (𝜑 → (𝐴 ∈ (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩) ↔ (𝐴X𝑥𝐵 (((1st𝐹)‘𝑥)𝐽((1st𝐺)‘𝑥)) ∧ ∀𝑥𝐵𝑦𝐵 ∈ (𝑥𝐻𝑦)((𝐴𝑦)(⟨((1st𝐹)‘𝑥), ((1st𝐹)‘𝑦)⟩ · ((1st𝐺)‘𝑦))((𝑥(2nd𝐹)𝑦)‘)) = (((𝑥(2nd𝐺)𝑦)‘)(⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩ · ((1st𝐺)‘𝑦))(𝐴𝑥)))))
209, 19bitrd 279 1 (𝜑 → (𝐴 ∈ (𝐹𝑁𝐺) ↔ (𝐴X𝑥𝐵 (((1st𝐹)‘𝑥)𝐽((1st𝐺)‘𝑥)) ∧ ∀𝑥𝐵𝑦𝐵 ∈ (𝑥𝐻𝑦)((𝐴𝑦)(⟨((1st𝐹)‘𝑥), ((1st𝐹)‘𝑦)⟩ · ((1st𝐺)‘𝑦))((𝑥(2nd𝐹)𝑦)‘)) = (((𝑥(2nd𝐺)𝑦)‘)(⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩ · ((1st𝐺)‘𝑦))(𝐴𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  wral 3047  cop 4582   class class class wbr 5091  Rel wrel 5621  cfv 6481  (class class class)co 7346  1st c1st 7919  2nd c2nd 7920  Xcixp 8821  Basecbs 17120  Hom chom 17172  compcco 17173   Func cfunc 17761   Nat cnat 17851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-ixp 8822  df-func 17765  df-nat 17853
This theorem is referenced by:  fuccocl  17874  fucidcl  17875  invfuc  17884  curf2cl  18137  yonedalem4c  18183  yonedalem3  18186
  Copyright terms: Public domain W3C validator