HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ssbrd 2094
Description: Deduction from a subclass relationship of binary relations.
Hypothesis
Ref Expression
ssbrd.1 |- (ph -> A (_ B)
Assertion
Ref Expression
ssbrd |- (ph -> (CAD -> CBD))

Proof of Theorem ssbrd
StepHypRef Expression
1 ssbrd.1 . . 3 |- (ph -> A (_ B)
21sseld 1506 . 2 |- (ph -> (<.C, D>. e. A -> <.C, D>. e. B))
3 df-br 2063 . 2 |- (CAD <-> <.C, D>. e. A)
4 df-br 2063 . 2 |- (CBD <-> <.C, D>. e. B)
52, 3, 43imtr4g 426 1 |- (ph -> (CAD -> CBD))
Colors of variables: wff set class
Syntax hints:   -> wi 2   e. wcel 1092   (_ wss 1487  <.cop 1810   class class class wbr 2054
This theorem is referenced by:  endom 3289
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-in 1491  df-ss 1492  df-br 2063
metamath.org