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

Theorem elimf 6490
Description: Eliminate a mapping hypothesis for the weak deduction theorem dedth 4484, when a special case 𝐺:𝐴𝐵 is provable, in order to convert 𝐹:𝐴𝐵 from a hypothesis to an antecedent. (Contributed by NM, 24-Aug-2006.)
Hypothesis
Ref Expression
elimf.1 𝐺:𝐴𝐵
Assertion
Ref Expression
elimf if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵

Proof of Theorem elimf
StepHypRef Expression
1 feq1 6472 . 2 (𝐹 = if(𝐹:𝐴𝐵, 𝐹, 𝐺) → (𝐹:𝐴𝐵 ↔ if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵))
2 feq1 6472 . 2 (𝐺 = if(𝐹:𝐴𝐵, 𝐹, 𝐺) → (𝐺:𝐴𝐵 ↔ if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵))
3 elimf.1 . 2 𝐺:𝐴𝐵
41, 2, 3elimhyp 4491 1 if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵
Colors of variables: wff setvar class
Syntax hints:  ifcif 4428  wf 6324
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-v 3446  df-un 3889  df-in 3891  df-ss 3901  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-br 5034  df-opab 5096  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-fun 6330  df-fn 6331  df-f 6332
This theorem is referenced by:  hosubcl  29560  hoaddcom  29561  hoaddass  29569  hocsubdir  29572  hoaddid1  29578  hodid  29579  ho0sub  29584  honegsub  29586  hoddi  29777
  Copyright terms: Public domain W3C validator