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

Theorem isfull2 16511
Description: Equivalent condition for a full functor. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
isfull.b 𝐵 = (Base‘𝐶)
isfull.j 𝐽 = (Hom ‘𝐷)
isfull.h 𝐻 = (Hom ‘𝐶)
Assertion
Ref Expression
isfull2 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐻,𝑦   𝑥,𝐽,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦

Proof of Theorem isfull2
StepHypRef Expression
1 isfull.b . . 3 𝐵 = (Base‘𝐶)
2 isfull.j . . 3 𝐽 = (Hom ‘𝐷)
31, 2isfull 16510 . 2 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
4 isfull.h . . . . . . 7 𝐻 = (Hom ‘𝐶)
5 simpll 789 . . . . . . 7 (((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) ∧ 𝑦𝐵) → 𝐹(𝐶 Func 𝐷)𝐺)
6 simplr 791 . . . . . . 7 (((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) ∧ 𝑦𝐵) → 𝑥𝐵)
7 simpr 477 . . . . . . 7 (((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) ∧ 𝑦𝐵) → 𝑦𝐵)
81, 4, 2, 5, 6, 7funcf2 16468 . . . . . 6 (((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) ∧ 𝑦𝐵) → (𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶((𝐹𝑥)𝐽(𝐹𝑦)))
9 ffn 6012 . . . . . 6 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)⟶((𝐹𝑥)𝐽(𝐹𝑦)) → (𝑥𝐺𝑦) Fn (𝑥𝐻𝑦))
10 df-fo 5863 . . . . . . 7 ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ((𝑥𝐺𝑦) Fn (𝑥𝐻𝑦) ∧ ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
1110baib 943 . . . . . 6 ((𝑥𝐺𝑦) Fn (𝑥𝐻𝑦) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
128, 9, 113syl 18 . . . . 5 (((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) ∧ 𝑦𝐵) → ((𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
1312ralbidva 2981 . . . 4 ((𝐹(𝐶 Func 𝐷)𝐺𝑥𝐵) → (∀𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ∀𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
1413ralbidva 2981 . . 3 (𝐹(𝐶 Func 𝐷)𝐺 → (∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
1514pm5.32i 668 . 2 ((𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
163, 15bitr4i 267 1 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥𝐺𝑦):(𝑥𝐻𝑦)–onto→((𝐹𝑥)𝐽(𝐹𝑦))))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 384   = wceq 1480  wcel 1987  wral 2908   class class class wbr 4623  ran crn 5085   Fn wfn 5852  wf 5853  ontowfo 5855  cfv 5857  (class class class)co 6615  Basecbs 15800  Hom chom 15892   Func cfunc 16454   Full cful 16502
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-1st 7128  df-2nd 7129  df-map 7819  df-ixp 7869  df-func 16458  df-full 16504
This theorem is referenced by:  fullfo  16512  isffth2  16516  cofull  16534  fullestrcsetc  16731  fullsetcestrc  16746
  Copyright terms: Public domain W3C validator