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

Theorem isffth2 17876
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 17871 . . 3 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
51, 3, 2isfth2 17875 . . 3 (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
64, 5anbi12i 629 . 2 ((𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺) ↔ ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ∧ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
7 brin 5138 . 2 (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Faith 𝐷)𝐺))
8 df-f1o 6499 . . . . . . 7 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
98biancomi 462 . . . . . 6 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1092ralbii 3113 . . . . 5 (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
11 r19.26-2 3123 . . . . 5 (∀𝑥𝐵𝑦𝐵 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1210, 11bitri 275 . . . 4 (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦))))
1312anbi2i 624 . . 3 ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1-onto→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–1-1→((𝐹𝑥)𝐽(𝐹𝑦)))))
14 anandi 677 . . 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 1542  wral 3052  cin 3889   class class class wbr 5086  1-1wf1 6489  ontowfo 6490  1-1-ontowf1o 6491  cfv 6492  (class class class)co 7360  Basecbs 17170  Hom chom 17222   Func cfunc 17812   Full cful 17862   Faith cfth 17863
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8768  df-ixp 8839  df-func 17816  df-full 17864  df-fth 17865
This theorem is referenced by:  idffth  17893  ressffth  17898  catciso  18069  yonffthlem  18239  swapfffth  49770  fucoppc  49897  thincciso2  49942  diagffth  50025
  Copyright terms: Public domain W3C validator