| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sspss | Structured version Visualization version GIF version | ||
| Description: Subclass in terms of proper subclass. (Contributed by NM, 25-Feb-1996.) |
| Ref | Expression |
|---|---|
| sspss | ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpss2 4018 | . . . . 5 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵)) | |
| 2 | 1 | simplbi2 506 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 → 𝐴 ⊊ 𝐵)) |
| 3 | 2 | con1d 146 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 ⊊ 𝐵 → 𝐴 = 𝐵)) |
| 4 | 3 | orrd 877 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵)) |
| 5 | pssss 4028 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵) | |
| 6 | eqimss 3971 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵) | |
| 7 | 5, 6 | jaoi 871 | . 2 ⊢ ((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) → 𝐴 ⊆ 𝐵) |
| 8 | 4, 7 | impbii 212 | 1 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∨ wo 861 = wceq 1570 ⊆ wss 3900 ⊊ wpss 4016 |
| 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-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1813 df-cleq 2755 df-ne 2960 df-ss 3901 df-pss 4017 |
| This theorem is used by: sspsstri 4036 sspsstr 4039 psssstr 4040 ordsseleq 6418 sorpssuni 7780 sorpssint 7781 ssnnfi 9223 ackbij1b 10355 fin23lem40 10468 zorng 10621 psslinpr 11155 suplem2pr 11177 ressval3d 17468 mrissmrcd 17864 pgpssslw 19879 pgpfac1lem5 20346 idnghm 25117 leslss 28352 dfon2lem4 36763 finminlem 37321 lkrss2N 40492 dvh3dim3N 42772 ordsssucb 44659 |
| Copyright terms: Public domain | W3C validator |