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 2935 | . . 3 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐵 = 𝐴) | |
2 | eqcom 2825 | . . 3 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵) | |
3 | 1, 2 | sylnib 329 | . 2 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐴 = 𝐵) |
4 | dfpss2 4059 | . . 3 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵)) | |
5 | 4 | baibr 537 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 ↔ 𝐴 ⊊ 𝐵)) |
6 | 3, 5 | syl5ib 245 | 1 ⊢ (𝐴 ⊆ 𝐵 → ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → 𝐴 ⊊ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ⊆ wss 3933 ⊊ wpss 3934 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1772 df-cleq 2811 df-clel 2890 df-ne 3014 df-pss 3951 |
This theorem is referenced by: ssnelpssd 4086 ssexnelpss 4087 isfin4p1 9725 canthp1lem2 10063 nqpr 10424 uzindi 13338 nthruc 15593 nthruz 15594 vitali 24141 onpsstopbas 33675 |
Copyright terms: Public domain | W3C validator |