Users' Mathboxes Mathbox for Jarvin Udandy < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mdandyvr11 Unicode version

Theorem mdandyvr11 27589
Description: Given the equivalences set in the hypotheses, there exist a proof where ch, th, ta, et match ze, si accordingly (Contributed by Jarvin Udandy, 7-Sep-2016.)
Hypotheses
Ref Expression
mdandyvr11.1  |-  ( ph  <->  ze )
mdandyvr11.2  |-  ( ps  <->  si )
mdandyvr11.3  |-  ( ch  <->  ps )
mdandyvr11.4  |-  ( th  <->  ps )
mdandyvr11.5  |-  ( ta  <->  ph )
mdandyvr11.6  |-  ( et  <->  ps )
Assertion
Ref Expression
mdandyvr11  |-  ( ( ( ( ch  <->  si )  /\  ( th  <->  si )
)  /\  ( ta  <->  ze ) )  /\  ( et 
<-> 
si ) )

Proof of Theorem mdandyvr11
StepHypRef Expression
1 mdandyvr11.2 . 2  |-  ( ps  <->  si )
2 mdandyvr11.1 . 2  |-  ( ph  <->  ze )
3 mdandyvr11.3 . 2  |-  ( ch  <->  ps )
4 mdandyvr11.4 . 2  |-  ( th  <->  ps )
5 mdandyvr11.5 . 2  |-  ( ta  <->  ph )
6 mdandyvr11.6 . 2  |-  ( et  <->  ps )
71, 2, 3, 4, 5, 6mdandyvr4 27582 1  |-  ( ( ( ( ch  <->  si )  /\  ( th  <->  si )
)  /\  ( ta  <->  ze ) )  /\  ( et 
<-> 
si ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    /\ wa 359
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8
This theorem depends on definitions:  df-bi 178  df-an 361
  Copyright terms: Public domain W3C validator