| 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 4316 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ∖ 𝐴) ≠ ∅) | |
| 2 | n0 4299 | . . 3 ⊢ ((𝐵 ∖ 𝐴) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐵 ∖ 𝐴)) | |
| 3 | 1, 2 | sylib 221 | . 2 ⊢ (𝐴 ⊊ 𝐵 → ∃𝑥 𝑥 ∈ (𝐵 ∖ 𝐴)) |
| 4 | eldif 4049 | . . 3 ⊢ (𝑥 ∈ (𝐵 ∖ 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ ¬ 𝑥 ∈ 𝐴)) | |
| 5 | 4 | exbii 1880 | . 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 1811 ∈ wcel 2144 ≠ wne 2955 ⊊ wpss 4013 ∖ cdif 4045 ∅c0 4278 |
| 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 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-ss 3896 df-pss 4014 df-dif 4047 df-nul 4279 |
| This theorem is used by: pssnn 9185 php 9223 php3 9225 inf3lem2 9631 infpssr 10387 ssfin4 10389 genpnnp 11091 ltexprlem1 11122 reclem2pr 11134 mrieqv2d 17814 lbspss 21358 lsmcv 21420 lidlnz 21531 obslbs 22037 nmoid 25062 spansncvi 32255 fvineqsneq 38411 lsat0cv 40166 osumcllem11N 41099 pexmidlem8N 41110 isomenndlem 47616 |
| Copyright terms: Public domain | W3C validator |