| 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 18037 | . 2 ⊢ Subcat = (𝑐 ∈ Cat ↦ {ℎ ∣ (ℎ ⊆cat (Homf ‘𝑐) ∧ [dom dom ℎ / 𝑠]∀𝑥 ∈ 𝑠 (((Id‘𝑐)‘𝑥) ∈ (𝑥ℎ𝑥) ∧ ∀𝑦 ∈ 𝑠 ∀𝑧 ∈ 𝑠 ∀𝑓 ∈ (𝑥ℎ𝑦)∀𝑔 ∈ (𝑦ℎ𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝑐)𝑧)𝑓) ∈ (𝑥ℎ𝑧)))}) | |
| 2 | 1 | mptrcl 7034 | 1 ⊢ (𝐻 ∈ (Subcat‘𝐶) → 𝐶 ∈ Cat) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2147 {cab 2741 ∀wral 3080 [wsbc 3742 〈cop 4840 class class class wbr 5108 dom cdm 5658 ‘cfv 6566 (class class class)co 7451 compcco 17484 Catccat 17888 Idccid 17889 Homf chomf 17890 ⊆cat cssc 18032 Subcatcsubc 18034 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-xp 5664 df-rel 5665 df-cnv 5666 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fv 6574 df-subc 18037 |
| This theorem is used by: subcssc 18065 subcidcl 18069 subccocl 18070 subccatid 18071 subsubc 18078 funcres2b 18122 funcres2 18123 idfusubc 18125 iinfsubc 50503 |
| Copyright terms: Public domain | W3C validator |