Theorem ssbr 5159

Description: Implication from a subclass relationship of binary relations. (Contributed by Peter Mazsa, 11-Nov-2019.)

Assertion

Ref	Expression
ssbr	⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷))

Proof of Theorem ssbr

Step	Hyp	Ref	Expression
1		id 23	. 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐵)
2	1	ssbrd 5158	1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷))

Syntax hints:   → wi 4   ⊆ wss 3913   class class class wbr 5113

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-clel 2844  df-ss 3930  df-br 5114

This theorem is referenced by:  ssbri  5160  coss1  5842  coss2  5843  cnvss  5859  ssrelrn  5885  ttrclss  9689  chnrss  18671  isucn2  24404  brelg  32893  cossss  39088