Theorem sspsstr 4071

Description: Transitive law for subclass and proper subclass. (Contributed by NM, 3-Apr-1996.)

Assertion

Ref	Expression
sspsstr	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶)

Proof of Theorem sspsstr

Step	Hyp	Ref	Expression
1		sspss 4065	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵))
2		psstr 4070	. . . . 5 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶)
3	2	ex 412	. . . 4 ⊢ (𝐴 ⊊ 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶))
4		psseq1 4053	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴 ⊊ 𝐶 ↔ 𝐵 ⊊ 𝐶))
5	4	biimprd 248	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶))
6	3, 5	jaoi 857	. . 3 ⊢ ((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) → (𝐵 ⊊ 𝐶 → 𝐴 ⊊ 𝐶))
7	6	imp 406	. 2 ⊢ (((𝐴 ⊊ 𝐵 ∨ 𝐴 = 𝐵) ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶)
8	1, 7	sylanb 581	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶)

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1540   ⊆ wss 3914   ⊊ wpss 3915

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1780  df-cleq 2721  df-ne 2926  df-ss 3931  df-pss 3934

This theorem is referenced by:  sspsstrd  4074  ordtr2  6377  php  9171  canthp1lem2  10606  suplem1pr  11005  fbfinnfr  23728  ppiltx  27087