![]() |
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 16820 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ 𝐹(𝐶 Full 𝐸)𝐺)) |
7 | 1, 2, 3, 4, 5 | fthres2c 16812 | . . 3 ⊢ (𝜑 → (𝐹(𝐶 Faith 𝐷)𝐺 ↔ 𝐹(𝐶 Faith 𝐸)𝐺)) |
8 | 6, 7 | anbi12d 749 | . 2 ⊢ (𝜑 → ((𝐹(𝐶 Full 𝐷)𝐺 ∧ 𝐹(𝐶 Faith 𝐷)𝐺) ↔ (𝐹(𝐶 Full 𝐸)𝐺 ∧ 𝐹(𝐶 Faith 𝐸)𝐺))) |
9 | brin 4856 | . 2 ⊢ (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ (𝐹(𝐶 Full 𝐷)𝐺 ∧ 𝐹(𝐶 Faith 𝐷)𝐺)) | |
10 | brin 4856 | . 2 ⊢ (𝐹((𝐶 Full 𝐸) ∩ (𝐶 Faith 𝐸))𝐺 ↔ (𝐹(𝐶 Full 𝐸)𝐺 ∧ 𝐹(𝐶 Faith 𝐸)𝐺)) | |
11 | 8, 9, 10 | 3bitr4g 303 | 1 ⊢ (𝜑 → (𝐹((𝐶 Full 𝐷) ∩ (𝐶 Faith 𝐷))𝐺 ↔ 𝐹((𝐶 Full 𝐸) ∩ (𝐶 Faith 𝐸))𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ∩ cin 3714 class class class wbr 4804 ⟶wf 6045 ‘cfv 6049 (class class class)co 6814 Basecbs 16079 ↾s cress 16080 Catccat 16546 Full cful 16783 Faith cfth 16784 |
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-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-cnex 10204 ax-resscn 10205 ax-1cn 10206 ax-icn 10207 ax-addcl 10208 ax-addrcl 10209 ax-mulcl 10210 ax-mulrcl 10211 ax-mulcom 10212 ax-addass 10213 ax-mulass 10214 ax-distr 10215 ax-i2m1 10216 ax-1ne0 10217 ax-1rid 10218 ax-rnegex 10219 ax-rrecex 10220 ax-cnre 10221 ax-pre-lttri 10222 ax-pre-lttrn 10223 ax-pre-ltadd 10224 ax-pre-mulgt0 10225 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-fal 1638 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-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-er 7913 df-map 8027 df-pm 8028 df-ixp 8077 df-en 8124 df-dom 8125 df-sdom 8126 df-pnf 10288 df-mnf 10289 df-xr 10290 df-ltxr 10291 df-le 10292 df-sub 10480 df-neg 10481 df-nn 11233 df-2 11291 df-3 11292 df-4 11293 df-5 11294 df-6 11295 df-7 11296 df-8 11297 df-9 11298 df-n0 11505 df-z 11590 df-dec 11706 df-ndx 16082 df-slot 16083 df-base 16085 df-sets 16086 df-ress 16087 df-hom 16188 df-cco 16189 df-cat 16550 df-cid 16551 df-homf 16552 df-comf 16553 df-ssc 16691 df-resc 16692 df-subc 16693 df-func 16739 df-full 16785 df-fth 16786 |
This theorem is referenced by: yoniso 17146 |
Copyright terms: Public domain | W3C validator |