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

Theorem isffth2 17880
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 17875 . . 3 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
51, 3, 2isfth2 17879 . . 3 (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
64, 5anbi12i 628 . 2 ((𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺) ↔ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ∧ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
7 brin 5159 . 2 (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺))
8 df-f1o 6518 . . . . . . 7 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
98biancomi 462 . . . . . 6 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1092ralbii 3108 . . . . 5 (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
11 r19.26-2 3118 . . . . 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 3044  cin 3913   class class class wbr 5107  1-1wf1 6508  ontowfo 6509  1-1-ontowf1o 6510  cfv 6511  (class class class)co 7387  Basecbs 17179  Hom chom 17231   Func cfunc 17816   Full cful 17866   Faith cfth 17867
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-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-map 8801  df-ixp 8871  df-func 17820  df-full 17868  df-fth 17869
This theorem is referenced by:  idffth  17897  ressffth  17902  catciso  18073  yonffthlem  18243  swapfffth  49272  fucoppc  49399  thincciso2  49444  diagffth  49527
  Copyright terms: Public domain W3C validator