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

Theorem isnat2 17913
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 17824 . . . . 5 Rel (𝐶 Func 𝐷)
2 isnat2.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
3 1st2nd 8018 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
41, 2, 3sylancr 587 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
5 isnat2.g . . . . 5 (𝜑𝐺 ∈ (𝐶 Func 𝐷))
6 1st2nd 8018 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → 𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
71, 5, 6sylancr 587 . . . 4 (𝜑𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
84, 7oveq12d 7405 . . 3 (𝜑 → (𝐹𝑁𝐺) = (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩))
98eleq2d 2814 . 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 8021 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
161, 2, 15sylancr 587 . . 3 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
17 1st2ndbr 8021 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
181, 5, 17sylancr 587 . . 3 (𝜑 → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
1910, 11, 12, 13, 14, 16, 18isnat 17912 . 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 1540  wcel 2109  wral 3044  cop 4595   class class class wbr 5107  Rel wrel 5643  cfv 6511  (class class class)co 7387  1st c1st 7966  2nd c2nd 7967  Xcixp 8870  Basecbs 17179  Hom chom 17231  compcco 17232   Func cfunc 17816   Nat cnat 17906
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-ixp 8871  df-func 17820  df-nat 17908
This theorem is referenced by:  fuccocl  17929  fucidcl  17930  invfuc  17939  curf2cl  18192  yonedalem4c  18238  yonedalem3  18241
  Copyright terms: Public domain W3C validator