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

Theorem isnat2 17997
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 17908 . . . . 5 Rel (𝐶 Func 𝐷)
2 isnat2.f . . . . 5 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
3 1st2nd 8065 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → 𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
41, 2, 3sylancr 587 . . . 4 (𝜑𝐹 = ⟨(1st𝐹), (2nd𝐹)⟩)
5 isnat2.g . . . . 5 (𝜑𝐺 ∈ (𝐶 Func 𝐷))
6 1st2nd 8065 . . . . 5 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → 𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
71, 5, 6sylancr 587 . . . 4 (𝜑𝐺 = ⟨(1st𝐺), (2nd𝐺)⟩)
84, 7oveq12d 7450 . . 3 (𝜑 → (𝐹𝑁𝐺) = (⟨(1st𝐹), (2nd𝐹)⟩𝑁⟨(1st𝐺), (2nd𝐺)⟩))
98eleq2d 2826 . 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 8068 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
161, 2, 15sylancr 587 . . 3 (𝜑 → (1st𝐹)(𝐶 Func 𝐷)(2nd𝐹))
17 1st2ndbr 8068 . . . 4 ((Rel (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
181, 5, 17sylancr 587 . . 3 (𝜑 → (1st𝐺)(𝐶 Func 𝐷)(2nd𝐺))
1910, 11, 12, 13, 14, 16, 18isnat 17996 . 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 1539  wcel 2107  wral 3060  cop 4631   class class class wbr 5142  Rel wrel 5689  cfv 6560  (class class class)co 7432  1st c1st 8013  2nd c2nd 8014  Xcixp 8938  Basecbs 17248  Hom chom 17309  compcco 17310   Func cfunc 17900   Nat cnat 17990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-1st 8015  df-2nd 8016  df-ixp 8939  df-func 17904  df-nat 17992
This theorem is referenced by:  fuccocl  18013  fucidcl  18014  invfuc  18023  curf2cl  18277  yonedalem4c  18323  yonedalem3  18326
  Copyright terms: Public domain W3C validator