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

Theorem isfth 17175
 Description: Value of the set of faithful functors between two categories. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypothesis
Ref Expression
isfth.b 𝐵 = (Base‘𝐶)
Assertion
Ref Expression
isfth (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦

Proof of Theorem isfth
Dummy variables 𝑐 𝑑 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fthfunc 17168 . . 3 (𝐶 Faith 𝐷) ⊆ (𝐶 Func 𝐷)
21ssbri 5087 . 2 (𝐹(𝐶 Faith 𝐷)𝐺𝐹(𝐶 Func 𝐷)𝐺)
3 df-br 5043 . . . . . . 7 (𝐹(𝐶 Func 𝐷)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷))
4 funcrcl 17124 . . . . . . 7 (⟨𝐹, 𝐺⟩ ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
53, 4sylbi 220 . . . . . 6 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
6 oveq12 7149 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (𝑐 Func 𝑑) = (𝐶 Func 𝐷))
76breqd 5053 . . . . . . . . 9 ((𝑐 = 𝐶𝑑 = 𝐷) → (𝑓(𝑐 Func 𝑑)𝑔𝑓(𝐶 Func 𝐷)𝑔))
8 simpl 486 . . . . . . . . . . . 12 ((𝑐 = 𝐶𝑑 = 𝐷) → 𝑐 = 𝐶)
98fveq2d 6656 . . . . . . . . . . 11 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = (Base‘𝐶))
10 isfth.b . . . . . . . . . . 11 𝐵 = (Base‘𝐶)
119, 10eqtr4di 2875 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (Base‘𝑐) = 𝐵)
1211raleqdv 3392 . . . . . . . . . 10 ((𝑐 = 𝐶𝑑 = 𝐷) → (∀𝑦 ∈ (Base‘𝑐)Fun (𝑥𝑔𝑦) ↔ ∀𝑦𝐵 Fun (𝑥𝑔𝑦)))
1311, 12raleqbidv 3382 . . . . . . . . 9 ((𝑐 = 𝐶𝑑 = 𝐷) → (∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)Fun (𝑥𝑔𝑦) ↔ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦)))
147, 13anbi12d 633 . . . . . . . 8 ((𝑐 = 𝐶𝑑 = 𝐷) → ((𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)Fun (𝑥𝑔𝑦)) ↔ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))))
1514opabbidv 5108 . . . . . . 7 ((𝑐 = 𝐶𝑑 = 𝐷) → {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)Fun (𝑥𝑔𝑦))} = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))})
16 df-fth 17166 . . . . . . 7 Faith = (𝑐 ∈ Cat, 𝑑 ∈ Cat ↦ {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝑐 Func 𝑑)𝑔 ∧ ∀𝑥 ∈ (Base‘𝑐)∀𝑦 ∈ (Base‘𝑐)Fun (𝑥𝑔𝑦))})
17 ovex 7173 . . . . . . . 8 (𝐶 Func 𝐷) ∈ V
18 simpl 486 . . . . . . . . . 10 ((𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦)) → 𝑓(𝐶 Func 𝐷)𝑔)
1918ssopab2i 5414 . . . . . . . . 9 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))} ⊆ {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝐶 Func 𝐷)𝑔}
20 opabss 5106 . . . . . . . . 9 {⟨𝑓, 𝑔⟩ ∣ 𝑓(𝐶 Func 𝐷)𝑔} ⊆ (𝐶 Func 𝐷)
2119, 20sstri 3951 . . . . . . . 8 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))} ⊆ (𝐶 Func 𝐷)
2217, 21ssexi 5202 . . . . . . 7 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))} ∈ V
2315, 16, 22ovmpoa 7289 . . . . . 6 ((𝐶 ∈ Cat ∧ 𝐷 ∈ Cat) → (𝐶 Faith 𝐷) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))})
245, 23syl 17 . . . . 5 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐶 Faith 𝐷) = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))})
2524breqd 5053 . . . 4 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Faith 𝐷)𝐺𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))}𝐺))
26 relfunc 17123 . . . . . 6 Rel (𝐶 Func 𝐷)
2726brrelex12i 5584 . . . . 5 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
28 breq12 5047 . . . . . . 7 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓(𝐶 Func 𝐷)𝑔𝐹(𝐶 Func 𝐷)𝐺))
29 simpr 488 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
3029oveqd 7157 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
3130cnveqd 5723 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥𝑔𝑦) = (𝑥𝐺𝑦))
3231funeqd 6356 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → (Fun (𝑥𝑔𝑦) ↔ Fun (𝑥𝐺𝑦)))
33322ralbidv 3189 . . . . . . 7 ((𝑓 = 𝐹𝑔 = 𝐺) → (∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦) ↔ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦)))
3428, 33anbi12d 633 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦)) ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦))))
35 eqid 2822 . . . . . 6 {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))} = {⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))}
3634, 35brabga 5398 . . . . 5 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))}𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦))))
3727, 36syl 17 . . . 4 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹{⟨𝑓, 𝑔⟩ ∣ (𝑓(𝐶 Func 𝐷)𝑔 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝑔𝑦))}𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦))))
3825, 37bitrd 282 . . 3 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦))))
3938bianabs 545 . 2 (𝐹(𝐶 Func 𝐷)𝐺 → (𝐹(𝐶 Faith 𝐷)𝐺 ↔ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦)))
402, 39biadanii 821 1 (𝐹(𝐶 Faith 𝐷)𝐺 ↔ (𝐹(𝐶 Func 𝐷)𝐺 ∧ ∀𝑥𝐵𝑦𝐵 Fun (𝑥𝐺𝑦)))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2114  ∀wral 3130  Vcvv 3469  ⟨cop 4545   class class class wbr 5042  {copab 5104  ◡ccnv 5531  Fun wfun 6328  ‘cfv 6334  (class class class)co 7140  Basecbs 16474  Catccat 16926   Func cfunc 17115   Faith cfth 17164 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-iun 4896  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-iota 6293  df-fun 6336  df-fv 6342  df-ov 7143  df-oprab 7144  df-mpo 7145  df-1st 7675  df-2nd 7676  df-func 17119  df-fth 17166 This theorem is referenced by:  isfth2  17176  fthpropd  17182  fthoppc  17184  fthres2b  17191  fthres2c  17192  fthres2  17193
 Copyright terms: Public domain W3C validator