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

Theorem isfull 17174
 Description: Value of the set of full functors between two categories. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
isfull.b 𝐵 = (Base‘𝐶)
isfull.j 𝐽 = (Hom ‘𝐷)
Assertion
Ref Expression
isfull (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐽,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦

Proof of Theorem isfull
Dummy variables 𝑐 𝑑 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fullfunc 17170 . . 3 (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
21ssbri 5103 . 2 (𝐹(𝐶 Full 𝐷)𝐺𝐹(𝐶 Func 𝐷)𝐺)
3 df-br 5059 . . . . . . 7 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
4 funcrcl 17127 . . . . . . 7 (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
53, 4sylbi 219 . . . . . 6 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
6 oveq12 7159 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (𝑐 Func 𝑑) = (𝐶 Func 𝐷))
76breqd 5069 . . . . . . . . 9 ((𝑐 = 𝐶𝑑 = 𝐷) → (𝑓(𝑐 Func 𝑑)𝑔𝑓(𝐶 Func 𝐷)𝑔))
8 simpl 485 . . . . . . . . . . . 12 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6668 . . . . . . . . . . 11 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 isfull.b . . . . . . . . . . 11 𝐵 = (Base‘𝐶)
119, 10syl6eqr 2874 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = 𝐵)
12 simpr 487 . . . . . . . . . . . . . . 15 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑑 = 𝐷)
1312fveq2d 6668 . . . . . . . . . . . . . 14 ((𝑐 = 𝐶𝑑 = 𝐷) → (Hom ‘𝑑) = (Hom ‘𝐷))
14 isfull.j . . . . . . . . . . . . . 14 𝐽 = (Hom ‘𝐷)
1513, 14syl6eqr 2874 . . . . . . . . . . . . 13 ((𝑐 = 𝐶𝑑 = 𝐷) → (Hom ‘𝑑) = 𝐽)
1615oveqd 7167 . . . . . . . . . . . 12 ((𝑐 = 𝐶𝑑 = 𝐷) → ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)))
1716eqeq2d 2832 . . . . . . . . . . 11 ((𝑐 = 𝐶𝑑 = 𝐷) → (ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)) ↔ ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦))))
1811, 17raleqbidv 3401 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)) ↔ ∀𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦))))
1911, 18raleqbidv 3401 . . . . . . . . 9 ((𝑐 = 𝐶𝑑 = 𝐷) → (∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦))))
207, 19anbi12d 632 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → ((𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦))) ↔ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))))
2120opabbidv 5124 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))} = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))})
22 df-full 17168 . . . . . . 7 Full = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝑑)(𝑓𝑦)))})
23 ovex 7183 . . . . . . . 8 (𝐶 Func 𝐷) ∈ V
24 simpl 485 . . . . . . . . . 10 ((𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦))) → 𝑓(𝐶 Func 𝐷)𝑔)
2524ssopab2i 5429 . . . . . . . . 9 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))} ⊆ {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝐶 Func 𝐷)𝑔}
26 opabss 5122 . . . . . . . . 9 {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝐶 Func 𝐷)𝑔} ⊆ (𝐶 Func 𝐷)
2725, 26sstri 3975 . . . . . . . 8 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))} ⊆ (𝐶 Func 𝐷)
2823, 27ssexi 5218 . . . . . . 7 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))} ∈ V
2921, 22, 28ovmpoa 7299 . . . . . 6 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 Full 𝐷) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))})
305, 29syl 17 . . . . 5 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐶 Full 𝐷) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))})
3130breqd 5069 . . . 4 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Full 𝐷)𝐺𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))}𝐺))
32 relfunc 17126 . . . . . 6 Rel (𝐶 Func 𝐷)
3332brrelex12i 5601 . . . . 5 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
34 breq12 5063 . . . . . . 7 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓(𝐶 Func 𝐷)𝑔𝐹(𝐶 Func 𝐷)𝐺))
35 simpr 487 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
3635oveqd 7167 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
3736rneqd 5802 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → ran (𝑥𝑔𝑦) = ran (𝑥𝐺𝑦))
38 simpl 485 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑓 = 𝐹)
3938fveq1d 6666 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓𝑥) = (𝐹𝑥))
4038fveq1d 6666 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓𝑦) = (𝐹𝑦))
4139, 40oveq12d 7168 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓𝑥)𝐽(𝑓𝑦)) = ((𝐹𝑥)𝐽(𝐹𝑦)))
4237, 41eqeq12d 2837 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → (ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)) ↔ ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
43422ralbidv 3199 . . . . . . 7 ((𝑓 = 𝐹𝑔 = 𝐺) → (∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
4434, 43anbi12d 632 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦))) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦)))))
45 eqid 2821 . . . . . 6 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))} = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))}
4644, 45brabga 5413 . . . . 5 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))}𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦)))))
4733, 46syl 17 . . . 4 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝑔𝑦) = ((𝑓𝑥)𝐽(𝑓𝑦)))}𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦)))))
4831, 47bitrd 281 . . 3 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦)))))
4948bianabs 544 . 2 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
502, 49biadanii 820 1 (𝐹(𝐶 Full 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 ran (𝑥𝐺𝑦) = ((𝐹𝑥)𝐽(𝐹𝑦))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  Vcvv 3494  ⟨cop 4566   class class class wbr 5058  {copab 5120  ran crn 5550  ‘cfv 6349  (class class class)co 7150  Basecbs 16477  Hom chom 16570  Catccat 16929   Func cfunc 17118   Full cful 17166 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-func 17122  df-full 17168 This theorem is referenced by:  isfull2  17175  fullpropd  17184  fulloppc  17186  fullres2c  17203
 Copyright terms: Public domain W3C validator