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

Theorem elimf 6667
Description: Eliminate a mapping hypothesis for the weak deduction theorem dedth 4544, 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 6649 . 2 (𝐹 = if(𝐹:𝐴𝐵, 𝐹, 𝐺) → (𝐹:𝐴𝐵 ↔ if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵))
2 feq1 6649 . 2 (𝐺 = if(𝐹:𝐴𝐵, 𝐹, 𝐺) → (𝐺:𝐴𝐵 ↔ if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵))
3 elimf.1 . 2 𝐺:𝐴𝐵
41, 2, 3elimhyp 4551 1 if(𝐹:𝐴𝐵, 𝐹, 𝐺):𝐴𝐵
Colors of variables: wff setvar class
Syntax hints:  ifcif 4486  wf 6492
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2707
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2714  df-cleq 2728  df-clel 2814  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-br 5106  df-opab 5168  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-fun 6498  df-fn 6499  df-f 6500
This theorem is referenced by:  hosubcl  30662  hoaddcom  30663  hoaddass  30671  hocsubdir  30674  hoaddid1  30680  hodid  30681  ho0sub  30686  honegsub  30688  hoddi  30879
  Copyright terms: Public domain W3C validator