| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssnpss | Structured version Visualization version GIF version | ||
| Description: Partial trichotomy law for subclasses. (Contributed by NM, 16-May-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
| Ref | Expression |
|---|---|
| ssnpss | ⊢ (𝐴 ⊆ 𝐵 → ¬ 𝐵 ⊊ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpss3 4044 | . . 3 ⊢ (𝐵 ⊊ 𝐴 ↔ (𝐵 ⊆ 𝐴 ∧ ¬ 𝐴 ⊆ 𝐵)) | |
| 2 | 1 | simprbi 502 | . 2 ⊢ (𝐵 ⊊ 𝐴 → ¬ 𝐴 ⊆ 𝐵) |
| 3 | 2 | con2i 140 | 1 ⊢ (𝐴 ⊆ 𝐵 → ¬ 𝐵 ⊊ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ⊆ wss 3906 ⊊ wpss 3907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1810 df-cleq 2755 df-ne 2959 df-ss 3923 df-pss 3926 |
| This theorem is referenced by: npss0 4369 nvpss 4371 sorpssuni 7731 sorpssint 7732 suplem2pr 11039 symgvalstruct 19468 lsppratlem6 21257 atcvati 32719 finxpreclem3 38020 lsatcvat 39805 |
| Copyright terms: Public domain | W3C validator |