| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pssnel | Structured version Visualization version GIF version | ||
| Description: A proper subclass has a member in one argument that's not in both. (Contributed by NM, 29-Feb-1996.) |
| Ref | Expression |
|---|---|
| pssnel | ⊢ (𝐴 ⊊ 𝐵 → ∃𝑥(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pssdif 4320 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ∖ 𝐴) ≠ ∅) | |
| 2 | n0 4303 | . . 3 ⊢ ((𝐵 ∖ 𝐴) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐵 ∖ 𝐴)) | |
| 3 | 1, 2 | sylib 221 | . 2 ⊢ (𝐴 ⊊ 𝐵 → ∃𝑥 𝑥 ∈ (𝐵 ∖ 𝐴)) |
| 4 | eldif 4052 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
| 5 | 4 | exbii 1881 | . 2 ⊢ (∃𝑥 𝑥 ∈ (𝐵 ∖ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) |
| 6 | 3, 5 | sylib 221 | 1 ⊢ (𝐴 ⊊ 𝐵 → ∃𝑥(𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 ⊊ wpss 4016 ∖ cdif 4048 ∅c0 4281 |
| 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-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-nul 4282 |
| This theorem is used by: pssnn 9222 php 9260 php3 9262 inf3lem2 9667 infpssr 10425 ssfin4 10427 genpnnp 11129 ltexprlem1 11160 reclem2pr 11172 mrieqv2d 17863 lbspss 21408 lsmcv 21470 lidlnz 21581 obslbs 22091 nmoid 25116 spansncvi 32311 elpssex 36672 elpssmo 36673 fvineqsneq 38603 lsat0cv 40356 osumcllem11N 41289 pexmidlem8N 41300 isomenndlem 47813 |
| Copyright terms: Public domain | W3C validator |