| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjssi | Structured version Visualization version GIF version | ||
| Description: Subclass theorem for disjoints, inference version. (Contributed by Peter Mazsa, 28-Sep-2021.) |
| Ref | Expression |
|---|---|
| disjssi.1 | ⊢ 𝐴 ⊆ 𝐵 |
| Ref | Expression |
|---|---|
| disjssi | ⊢ ( Disj 𝐵 → Disj 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjssi.1 | . 2 ⊢ 𝐴 ⊆ 𝐵 | |
| 2 | disjss 39872 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ( Disj 𝐵 → Disj 𝐴)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ( Disj 𝐵 → Disj 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3896 Disj wdisjALTV 39260 |
| 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-11 2193 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| 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-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-coss 39542 df-cnvrefrel 39648 df-funALTV 39808 df-disjALTV 39831 |
| This theorem is used by: disjimres 39891 disjimin 39892 |
| Copyright terms: Public domain | W3C validator |