| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subcrcl | Structured version Visualization version GIF version | ||
| Description: Reverse closure for the subcategory predicate. (Contributed by Mario Carneiro, 6-Jan-2017.) |
| Ref | Expression |
|---|---|
| subcrcl | ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐶 ∈ Cat) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-subc 17902 | . 2 ⊢ Subcat = (𝑐 ∈ Cat ↦ {ℎ ∣ (ℎ ⊆cat (Homf ‘𝑐) ∧ [dom dom ℎ / 𝑠]∀𝑥 ∈ 𝑠 (((Id‘𝑐)‘𝑥) ∈ (𝑥ℎ𝑥) ∧ ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥ℎ𝑦)∀𝑔 ∈ (𝑦ℎ𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥ℎ𝑧)))}) | |
| 2 | 1 | mptrcl 6997 | 1 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐶 ∈ Cat) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 {cab 2738 ∀wral 3076 [wsbc 3739 〈cop 4590 class class class wbr 5103 dom cdm 5655 ‘cfv 6533 (class class class)co 7414 compcco 17355 Catccat 17753 Idccid 17754 Homf chomf 17755 ⊆cat cssc 17897 Subcatcsubc 17899 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-xp 5661 df-rel 5662 df-cnv 5663 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fv 6541 df-subc 17902 |
| This theorem is used by: subcssc 17930 subcidcl 17934 subccocl 17935 subccatid 17936 subsubc 17943 funcres2b 17987 funcres2 17988 idfusubc 17990 iinfsubc 49985 |
| Copyright terms: Public domain | W3C validator |