Theorem ssbr 5136

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 22	. 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐵)
2	1	ssbrd 5135	1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷))

Syntax hints:   → wi 4   ⊆ wss 3903   class class class wbr 5092

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-8 2111

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-clel 2803  df-ss 3920  df-br 5093

This theorem is referenced by:  ssbri  5137  coss1  5798  coss2  5799  cnvss  5815  ssrelrn  5837  ttrclss  9616  isucn2  24164  brelg  32554  cossss  38412