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

Theorem sylan9ssOLD 2629
Description: A subclass transitivity deduction.
Hypotheses
Ref Expression
sylan9ss.1 |- (ph -> A C_ B)
sylan9ss.2 |- (ps -> B C_ C)
Assertion
Ref Expression
sylan9ssOLD |- ((ph /\ ps) -> A C_ C)

Proof of Theorem sylan9ssOLD
StepHypRef Expression
1 sylan9ss.1 . . 3 |- (ph -> A C_ B)
21adantr 425 . 2 |- ((ph /\ ps) -> A C_ B)
3 sylan9ss.2 . . 3 |- (ps -> B C_ C)
43adantl 424 . 2 |- ((ph /\ ps) -> B C_ C)
52, 4sstrd 2627 1 |- ((ph /\ ps) -> A C_ C)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   C_ wss 2593
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-10 1308  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-in 2603  df-ss 2605
Copyright terms: Public domain