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

Theorem isnat2 16608
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 16522 . . . . 5 Rel (𝐶 Func 𝐷)
2 isnat2.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
3 1st2nd 7214 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
41, 2, 3sylancr 695 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
5 isnat2.g . . . . 5 (𝜑𝐺 ∈ (𝐶 Func 𝐷))
6 1st2nd 7214 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → 𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
71, 5, 6sylancr 695 . . . 4 (𝜑𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
84, 7oveq12d 6668 . . 3 (𝜑 → (𝐹𝑁𝐺) = (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩))
98eleq2d 2687 . 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 7217 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
161, 2, 15sylancr 695 . . 3 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
17 1st2ndbr 7217 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
181, 5, 17sylancr 695 . . 3 (𝜑 → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
1910, 11, 12, 13, 14, 16, 18isnat 16607 . 2 (𝜑 → (𝐴 ∈ (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩) ↔ (𝐴X𝑥𝐵 (((1st𝐹)‘𝑥)𝐽((1st𝐺)‘𝑥)) ∧ ∀𝑥𝐵𝑦𝐵 ∈ (𝑥𝐻𝑦)((𝐴𝑦)(⟨((1st𝐹)‘𝑥), ((1st𝐹)‘𝑦)⟩ · ((1st𝐺)‘𝑦))((𝑥(2nd𝐹)𝑦)‘)) = (((𝑥(2nd𝐺)𝑦)‘)(⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩ · ((1st𝐺)‘𝑦))(𝐴𝑥)))))
209, 19bitrd 268 1 (𝜑 → (𝐴 ∈ (𝐹𝑁𝐺) ↔ (𝐴X𝑥𝐵 (((1st𝐹)‘𝑥)𝐽((1st𝐺)‘𝑥)) ∧ ∀𝑥𝐵𝑦𝐵 ∈ (𝑥𝐻𝑦)((𝐴𝑦)(⟨((1st𝐹)‘𝑥), ((1st𝐹)‘𝑦)⟩ · ((1st𝐺)‘𝑦))((𝑥(2nd𝐹)𝑦)‘)) = (((𝑥(2nd𝐺)𝑦)‘)(⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩ · ((1st𝐺)‘𝑦))(𝐴𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wral 2912  cop 4183   class class class wbr 4653  Rel wrel 5119  cfv 5888  (class class class)co 6650  1st c1st 7166  2nd c2nd 7167  Xcixp 7908  Basecbs 15857  Hom chom 15952  compcco 15953   Func cfunc 16514   Nat cnat 16601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-ixp 7909  df-func 16518  df-nat 16603
This theorem is referenced by:  fuccocl  16624  fucidcl  16625  invfuc  16634  curf2cl  16871  yonedalem4c  16917  yonedalem3  16920
  Copyright terms: Public domain W3C validator