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

Theorem dedth2v 4143
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 4140 is simpler to use. See also comments in dedth 4139. (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 4140 . 2  |-  ( (
ph  /\  ph )  ->  ps )
54anidms 677 1  |-  ( ph  ->  ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483   ifcif 4086
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-if 4087
This theorem is referenced by:  ltweuz  12760  omlsi  28263  pjhfo  28565
  Copyright terms: Public domain W3C validator