Theorem sspss 4050

Description: Subclass in terms of proper subclass. (Contributed by NM, 25-Feb-1996.)

Assertion

Ref	Expression
sspss	⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵))

Proof of Theorem sspss

Step	Hyp	Ref	Expression
1		dfpss2 4036	. . . . 5 ⊢ (𝐴 ⊊ 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐴 = 𝐵))
2	1	simplbi2 506	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 = 𝐵 → 𝐴 ⊊ 𝐵))
3	2	con1d 146	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (¬ 𝐴 ⊊ 𝐵 → 𝐴 = 𝐵))
4	3	orrd 877	. 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵))
5		pssss 4046	. . 3 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵)
6		eqimss 3989	. . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
7	5, 6	jaoi 871	. 2 ⊢ ((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) → 𝐴 ⊆ 𝐵)
8	4, 7	impbii 212	1 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∨ wo 861   = wceq 1570   ⊆ wss 3899   ⊊ wpss 3900

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-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-cleq 2752  df-ne 2956  df-ss 3916  df-pss 3919

This theorem is used by:  sspsstri  4054  sspsstr  4057  psssstr  4058  ordsseleq  6387  sorpssuni  7734  sorpssint  7735  ssnnfi  9167  ackbij1b  10243  fin23lem40  10356  zorng  10509  psslinpr  11043  suplem2pr  11065  ressval3d  17341  mrissmrcd  17731  pgpssslw  19744  pgpfac1lem5  20211  idnghm  24972  leslss  28177  dfon2lem4  36366  finminlem  36940  lkrss2N  40045  dvh3dim3N  42325  ordsssucb  44179