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

Theorem sylan9ssr 1515
Description: A subclass transitivity deduction.
Hypotheses
Ref Expression
sylan9ssr.1 |- (ph -> A (_ B)
sylan9ssr.2 |- (ps -> B (_ C)
Assertion
Ref Expression
sylan9ssr |- ((ps /\ ph) -> A (_ C)

Proof of Theorem sylan9ssr
StepHypRef Expression
1 sylan9ssr.1 . . 3 |- (ph -> A (_ B)
2 sylan9ssr.2 . . 3 |- (ps -> B (_ C)
31, 2sylan9ss 1514 . 2 |- ((ph /\ ps) -> A (_ C)
43ancoms 334 1 |- ((ps /\ ph) -> A (_ C)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   (_ wss 1487
This theorem is referenced by:  cardinfima 3696
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
metamath.org