Theorem ssnelpss 4066

Description: A subclass missing a member is a proper subclass. (Contributed by NM, 12-Jan-2002.)

Assertion

Ref	Expression
ssnelpss	⊢ (𝐴 ⊆ 𝐵 → ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → 𝐴 ⊊ 𝐵))

Proof of Theorem ssnelpss

Step	Hyp	Ref	Expression
1		nelneq2 2887	. . 3 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐵 = 𝐴)
2	1	neqcomd 2772	. 2 ⊢ ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → ¬ 𝐴 = 𝐵)
3		dfpss2 4039	. . 3 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵))
4	3	baibr 546	. 2 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 ↔ 𝐴 ⊊ 𝐵))
5	2, 4	imbitrid 247	1 ⊢ (𝐴 ⊆ 𝐵 → ((𝐶 ∈ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴) → 𝐴 ⊊ 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3902   ⊊ wpss 3903

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2754  df-clel 2837  df-ne 2958  df-pss 3922

This theorem is used by:  ssnelpssd  4067  ssexnelpss  4068  isfin4p1  10320  canthp1lem2  10665  nqpr  11026  uzindi  14048  nthruc  16344  nthruz  16345  vitali  25842  onpsstopbas  37036  numtowerdt  47721