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

Theorem fullfunc 16787
 Description: A full functor is a functor. (Contributed by Mario Carneiro, 26-Jan-2017.)
Assertion
Ref Expression
fullfunc (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)

Proof of Theorem fullfunc
Dummy variables 𝑐 𝑑 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6821 . . . 4 (𝑐 = 𝐶 → (𝑐 Full 𝑑) = (𝐶 Full 𝑑))
2 oveq1 6821 . . . 4 (𝑐 = 𝐶 → (𝑐 Func 𝑑) = (𝐶 Func 𝑑))
31, 2sseq12d 3775 . . 3 (𝑐 = 𝐶 → ((𝑐 Full 𝑑) ⊆ (𝑐 Func 𝑑) ↔ (𝐶 Full 𝑑) ⊆ (𝐶 Func 𝑑)))
4 oveq2 6822 . . . 4 (𝑑 = 𝐷 → (𝐶 Full 𝑑) = (𝐶 Full 𝐷))
5 oveq2 6822 . . . 4 (𝑑 = 𝐷 → (𝐶 Func 𝑑) = (𝐶 Func 𝐷))
64, 5sseq12d 3775 . . 3 (𝑑 = 𝐷 → ((𝐶 Full 𝑑) ⊆ (𝐶 Func 𝑑) ↔ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)))
7 ovex 6842 . . . . . 6 (𝑐 Func 𝑑) ∈ V
8 simpl 474 . . . . . . . 8 ((𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦))) → 𝑓(𝑐 Func 𝑑)𝑔)
98ssopab2i 5153 . . . . . . 7 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))} ⊆ {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝑐 Func 𝑑)𝑔}
10 opabss 4866 . . . . . . 7 {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝑐 Func 𝑑)𝑔} ⊆ (𝑐 Func 𝑑)
119, 10sstri 3753 . . . . . 6 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))} ⊆ (𝑐 Func 𝑑)
127, 11ssexi 4955 . . . . 5 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))} ∈ V
13 df-full 16785 . . . . . 6 Full = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))})
1413ovmpt4g 6949 . . . . 5 ((𝑐 ∈ Cat ∧ 𝑑 ∈ Cat ∧ {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))} ∈ V) → (𝑐 Full 𝑑) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))})
1512, 14mp3an3 1562 . . . 4 ((𝑐 ∈ Cat ∧ 𝑑 ∈ Cat) → (𝑐 Full 𝑑) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))})
1615, 11syl6eqss 3796 . . 3 ((𝑐 ∈ Cat ∧ 𝑑 ∈ Cat) → (𝑐 Full 𝑑) ⊆ (𝑐 Func 𝑑))
173, 6, 16vtocl2ga 3414 . 2 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷))
1813mpt2ndm0 7041 . . 3 (¬ (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 Full 𝐷) = ∅)
19 0ss 4115 . . 3 ∅ ⊆ (𝐶 Func 𝐷)
2018, 19syl6eqss 3796 . 2 (¬ (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷))
2117, 20pm2.61i 176 1 (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ∧ wa 383   = wceq 1632   ∈ wcel 2139  ∀wral 3050  Vcvv 3340   ⊆ wss 3715  ∅c0 4058   class class class wbr 4804  {copab 4864  ran crn 5267  ‘cfv 6049  (class class class)co 6814  Basecbs 16079  Hom chom 16174  Catccat 16546   Func cfunc 16735   Full cful 16783 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-iota 6012  df-fun 6051  df-fv 6057  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-full 16785 This theorem is referenced by:  relfull  16789  isfull  16791  fulloppc  16803  cofull  16815  catcisolem  16977  catciso  16978
 Copyright terms: Public domain W3C validator