Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ffthres2c | Structured version Visualization version GIF version |
Description: Condition for a fully faithful functor to also be a fully faithful functor into the restriction. (Contributed by Mario Carneiro, 27-Jan-2017.) |
Ref | Expression |
---|---|
ffthres2c.a | ⊢ 𝐴 = (Base‘𝐶) |
ffthres2c.e | ⊢ 𝐸 = (𝐷 ↾s 𝑆) |
ffthres2c.d | ⊢ (𝜑 → 𝐷 ∈ Cat) |
ffthres2c.r | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
ffthres2c.1 | ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) |
Ref | Expression |
---|---|
ffthres2c | ⊢ (𝜑 → (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ 𝐹((𝐶 Full 𝐸) ∩ (𝐶 Faith 𝐸))𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ffthres2c.a | . . . 4 ⊢ 𝐴 = (Base‘𝐶) | |
2 | ffthres2c.e | . . . 4 ⊢ 𝐸 = (𝐷 ↾s 𝑆) | |
3 | ffthres2c.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
4 | ffthres2c.r | . . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
5 | ffthres2c.1 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
6 | 1, 2, 3, 4, 5 | fullres2c 17203 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ 𝐹(𝐶 Full 𝐸)𝐺)) |
7 | 1, 2, 3, 4, 5 | fthres2c 17195 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Faith 𝐷)𝐺 ↔ 𝐹(𝐶 Faith 𝐸)𝐺)) |
8 | 6, 7 | anbi12d 632 | . 2 ⊢ (𝜑 → ((𝐹(𝐶 Full 𝐷)𝐺 ∧ 𝐹(𝐶 Faith 𝐷)𝐺) ↔ (𝐹(𝐶 Full 𝐸)𝐺 ∧ 𝐹(𝐶 Faith 𝐸)𝐺))) |
9 | brin 5110 | . 2 ⊢ (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Full 𝐷)𝐺 ∧ 𝐹(𝐶 Faith 𝐷)𝐺)) | |
10 | brin 5110 | . 2 ⊢ (𝐹((𝐶 Full 𝐸) ∩ (𝐶 Faith 𝐸))𝐺 ↔ (𝐹(𝐶 Full 𝐸)𝐺 ∧ 𝐹(𝐶 Faith 𝐸)𝐺)) | |
11 | 8, 9, 10 | 3bitr4g 316 | 1 ⊢ (𝜑 → (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ 𝐹((𝐶 Full 𝐸) ∩ (𝐶 Faith 𝐸))𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∩ cin 3934 class class class wbr 5058 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 Basecbs 16477 ↾s cress 16478 Catccat 16929 Full cful 17166 Faith cfth 17167 |
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-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 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-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 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-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 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-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-map 8402 df-pm 8403 df-ixp 8456 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-n0 11892 df-z 11976 df-dec 12093 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-hom 16583 df-cco 16584 df-cat 16933 df-cid 16934 df-homf 16935 df-comf 16936 df-ssc 17074 df-resc 17075 df-subc 17076 df-func 17122 df-full 17168 df-fth 17169 |
This theorem is referenced by: yoniso 17529 |
Copyright terms: Public domain | W3C validator |