MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dedth2v Unicode version

Theorem dedth2v 3610
Description: Weak deduction theorem for eliminating a hypothesis with 2 class variables. Note: if the hypothesis can be separated into two hypotheses, each with one class variable, then dedth2h 3607 is simpler to use. See also comments in dedth 3606. (Contributed by NM, 13-Aug-1999.) (Proof shortened by Eric Schmidt, 28-Jul-2009.)
Hypotheses
Ref Expression
dedth2v.1  |-  ( A  =  if ( ph ,  A ,  C )  ->  ( ps  <->  ch )
)
dedth2v.2  |-  ( B  =  if ( ph ,  B ,  D )  ->  ( ch  <->  th )
)
dedth2v.3  |-  th
Assertion
Ref Expression
dedth2v  |-  ( ph  ->  ps )

Proof of Theorem dedth2v
StepHypRef Expression
1 dedth2v.1 . . 3  |-  ( A  =  if ( ph ,  A ,  C )  ->  ( ps  <->  ch )
)
2 dedth2v.2 . . 3  |-  ( B  =  if ( ph ,  B ,  D )  ->  ( ch  <->  th )
)
3 dedth2v.3 . . 3  |-  th
41, 2, 3dedth2h 3607 . 2  |-  ( (
ph  /\  ph )  ->  ps )
54anidms 626 1  |-  ( ph  ->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    = wceq 1623   ifcif 3565
This theorem is referenced by:  ltweuz  11024  omlsi  21983  pjhfo  22285  ghomgrplem  23996
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-if 3566
  Copyright terms: Public domain W3C validator