Theorem ssbri 4153

Description: Inference from a subclass relationship of binary relations. (Contributed by NM, 28-Mar-2007.) (Revised by Mario Carneiro, 8-Feb-2015.)

Hypothesis

Ref	Expression
ssbri.1	⊢ 𝐴 ⊆ 𝐵

Assertion

Ref	Expression
ssbri	⊢ (𝐶𝐴𝐷 → 𝐶𝐵𝐷)

Proof of Theorem ssbri

Step	Hyp	Ref	Expression
1		ssbri.1	. . . 4 ⊢ 𝐴 ⊆ 𝐵
2	1	a1i 9	. . 3 ⊢ (⊤ → 𝐴 ⊆ 𝐵)
3	2	ssbrd 4151	. 2 ⊢ (⊤ → (𝐶𝐴𝐷 → 𝐶𝐵𝐷))
4	3	mptru 1407	1 ⊢ (𝐶𝐴𝐷 → 𝐶𝐵𝐷)

Syntax hints:   → wi 4  ⊤wtru 1399   ⊆ wss 3210   class class class wbr 4108

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-11 1555  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-in 3216  df-ss 3223  df-br 4109

This theorem is referenced by:  brel  4801  swoer  6794  swoord1  6795  swoord2  6796  ecopover  6866  ecopoverg  6869  endom  7001