Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eelTT1 Structured version   Unicode version

Theorem eelTT1 32582
Description: An elimination deduction. (Contributed by Alan Sare, 4-Feb-2017.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
eelTT1.1  |-  ( T. 
->  ph )
eelTT1.2  |-  ( T. 
->  ps )
eelTT1.3  |-  ( ch 
->  th )
eelTT1.4  |-  ( (
ph  /\  ps  /\  th )  ->  ta )
Assertion
Ref Expression
eelTT1  |-  ( ch 
->  ta )

Proof of Theorem eelTT1
StepHypRef Expression
1 3anass 977 . . 3  |-  ( ( T.  /\ T.  /\  ch )  <->  ( T.  /\  ( T.  /\  ch )
) )
2 anabs5 807 . . 3  |-  ( ( T.  /\  ( T. 
/\  ch ) )  <->  ( T.  /\  ch ) )
3 truan 1396 . . 3  |-  ( ( T.  /\  ch )  <->  ch )
41, 2, 33bitri 271 . 2  |-  ( ( T.  /\ T.  /\  ch )  <->  ch )
5 eelTT1.3 . . 3  |-  ( ch 
->  th )
6 eelTT1.2 . . . 4  |-  ( T. 
->  ps )
7 eelTT1.1 . . . . 5  |-  ( T. 
->  ph )
8 eelTT1.4 . . . . 5  |-  ( (
ph  /\  ps  /\  th )  ->  ta )
97, 8syl3an1 1261 . . . 4  |-  ( ( T.  /\  ps  /\  th )  ->  ta )
106, 9syl3an2 1262 . . 3  |-  ( ( T.  /\ T.  /\  th )  ->  ta )
115, 10syl3an3 1263 . 2  |-  ( ( T.  /\ T.  /\  ch )  ->  ta )
124, 11sylbir 213 1  |-  ( ch 
->  ta )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    /\ w3a 973   T. wtru 1380
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 185  df-an 371  df-3an 975  df-tru 1382
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator