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

Theorem isffth2 17931
Description: A fully faithful functor is a functor which is bijective on hom-sets. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
isfth.b 𝐵 = (Base‘𝐶)
isfth.h 𝐻 = (Hom ‘𝐶)
isfth.j 𝐽 = (Hom ‘𝐷)
Assertion
Ref Expression
isffth2 (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦))))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝑥,𝐽,𝑦

Proof of Theorem isffth2
StepHypRef Expression
1 isfth.b . . . 4 𝐵 = (Base‘𝐶)
2 isfth.j . . . 4 𝐽 = (Hom ‘𝐷)
3 isfth.h . . . 4 𝐻 = (Hom ‘𝐶)
41, 2, 3isfull2 17926 . . 3 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
51, 3, 2isfth2 17930 . . 3 (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
64, 5anbi12i 628 . 2 ((𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺) ↔ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ∧ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
7 brin 5171 . 2 (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺))
8 df-f1o 6538 . . . . . . 7 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
98biancomi 462 . . . . . 6 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1092ralbii 3115 . . . . 5 (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
11 r19.26-2 3125 . . . . 5 (∀𝑥𝐵𝑦𝐵 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1210, 11bitri 275 . . . 4 (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1312anbi2i 623 . . 3 ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
14 anandi 676 . . 3 ((𝐹(𝐶 Func 𝐷)𝐺 ∧ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))) ↔ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ∧ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
1513, 14bitri 275 . 2 ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ∧ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
166, 7, 153bitr4i 303 1 (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wral 3051  cin 3925   class class class wbr 5119  1-1wf1 6528  ontowfo 6529  1-1-ontowf1o 6530  cfv 6531  (class class class)co 7405  Basecbs 17228  Hom chom 17282   Func cfunc 17867   Full cful 17917   Faith cfth 17918
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-map 8842  df-ixp 8912  df-func 17871  df-full 17919  df-fth 17920
This theorem is referenced by:  idffth  17948  ressffth  17953  catciso  18124  yonffthlem  18294  swapfffth  49200  thincciso2  49341  diagffth  49423
  Copyright terms: Public domain W3C validator