| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isthincd | Structured version Visualization version GIF version | ||
| Description: The predicate "is a thin category" (deduction form). (Contributed by Zhi Wang, 17-Sep-2024.) |
| Ref | Expression |
|---|---|
| isthincd.b | ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) |
| isthincd.h | ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶)) |
| isthincd.t | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦)) |
| isthincd.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| Ref | Expression |
|---|---|
| isthincd | ⊢ (𝜑 → 𝐶 ∈ ThinCat) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isthincd.c | . 2 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 2 | isthincd.t | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦)) | |
| 3 | 2 | ralrimivva 3205 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦)) |
| 4 | isthincd.b | . . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) | |
| 5 | isthincd.h | . . . . . . . 8 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶)) | |
| 6 | 5 | oveqd 7437 | . . . . . . 7 ⊢ (𝜑 → (𝑥𝐻𝑦) = (𝑥(Hom ‘𝐶)𝑦)) |
| 7 | 6 | eleq2d 2846 | . . . . . 6 ⊢ (𝜑 → (𝑓 ∈ (𝑥𝐻𝑦) ↔ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) |
| 8 | 7 | mobidv 2574 | . . . . 5 ⊢ (𝜑 → (∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) |
| 9 | 4, 8 | raleqbidv 3334 | . . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) |
| 10 | 4, 9 | raleqbidv 3334 | . . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) |
| 11 | 3, 10 | mpbid 235 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)) |
| 12 | eqid 2760 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 13 | eqid 2760 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 14 | 12, 13 | isthinc 50647 | . 2 ⊢ (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) |
| 15 | 1, 11, 14 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝐶 ∈ ThinCat) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃*wmo 2562 ∀wral 3076 ‘cfv 6538 (class class class)co 7420 Basecbs 17392 Hom chom 17444 Catccat 17843 ThinCatcthinc 50645 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-nul 5259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-iota 6494 df-fv 6546 df-ov 7423 df-thinc 50646 |
| This theorem is used by: isthincd2 50665 oppcthin 50666 subthinc 50671 thincciso2 50683 indcthing 50688 discthing 50689 setcthin 50693 idfudiag1 50753 arweuthinc 50757 funcsn 50772 0fucterm 50774 |
| Copyright terms: Public domain | W3C validator |