Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssnelpss | Structured version Visualization version GIF version |
Description: A subclass missing a member is a proper subclass. (Contributed by NM, 12-Jan-2002.) |
Ref | Expression |
---|---|
ssnelpss | ⊢ (𝐴 ⊆ 𝐵 → ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → 𝐴 ⊊ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nelneq2 2864 | . . 3 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐵 = 𝐴) | |
2 | eqcom 2745 | . . 3 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵) | |
3 | 1, 2 | sylnib 328 | . 2 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐴 = 𝐵) |
4 | dfpss2 4020 | . . 3 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵)) | |
5 | 4 | baibr 537 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 ↔ 𝐴 ⊊ 𝐵)) |
6 | 3, 5 | syl5ib 243 | 1 ⊢ (𝐴 ⊆ 𝐵 → ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → 𝐴 ⊊ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ⊆ wss 3887 ⊊ wpss 3888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1783 df-cleq 2730 df-clel 2816 df-ne 2944 df-pss 3906 |
This theorem is referenced by: ssnelpssd 4047 ssexnelpss 4048 isfin4p1 10071 canthp1lem2 10409 nqpr 10770 uzindi 13702 nthruc 15961 nthruz 15962 vitali 24777 onpsstopbas 34619 |
Copyright terms: Public domain | W3C validator |