| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0subcat | Structured version Visualization version GIF version | ||
| Description: For any category 𝐶, the empty set is a (full) subcategory of 𝐶, see example 4.3(1.a) in [Adamek] p. 48. (Contributed by AV, 23-Apr-2020.) |
| Ref | Expression |
|---|---|
| 0subcat | ⊢ (𝐶 ∈ Cat → ∅ ∈ (Subcat‘𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ssc 18062 | . 2 ⊢ (𝐶 ∈ Cat → ∅ ⊆cat (Homf ‘𝐶)) | |
| 2 | ral0 4457 | . . 3 ⊢ ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧)) | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧))) |
| 4 | eqid 2763 | . . 3 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶) | |
| 5 | eqid 2763 | . . 3 ⊢ (Id‘𝐶) = (Id‘𝐶) | |
| 6 | eqid 2763 | . . 3 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
| 7 | id 23 | . . 3 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat) | |
| 8 | f0 6793 | . . . . . 6 ⊢ ∅:∅⟶∅ | |
| 9 | ffn 6739 | . . . . . 6 ⊢ (∅:∅⟶∅ → ∅ Fn ∅) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ ∅ Fn ∅ |
| 11 | 0xp 5758 | . . . . . 6 ⊢ (∅ × ∅) = ∅ | |
| 12 | 11 | fneq2i 6667 | . . . . 5 ⊢ (∅ Fn (∅ × ∅) ↔ ∅ Fn ∅) |
| 13 | 10, 12 | mpbir 234 | . . . 4 ⊢ ∅ Fn (∅ × ∅) |
| 14 | 13 | a1i 11 | . . 3 ⊢ (𝐶 ∈ Cat → ∅ Fn (∅ × ∅)) |
| 15 | 4, 5, 6, 7, 14 | issubc2 18061 | . 2 ⊢ (𝐶 ∈ Cat → (∅ ∈ (Subcat‘𝐶) ↔ (∅ ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧))))) |
| 16 | 1, 3, 15 | mpbir2and 726 | 1 ⊢ (𝐶 ∈ Cat → ∅ ∈ (Subcat‘𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2147 ∀wral 3080 ∅c0 4281 〈cop 4840 class class class wbr 5108 × cxp 5656 Fn wfn 6561 ⟶wf 6562 ‘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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-pm 8888 df-ixp 8964 df-homf 17894 df-ssc 18035 df-subc 18037 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |