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

Theorem elimne0 11066
Description: Hypothesis for weak deduction theorem to eliminate 𝐴 ≠ 0. (Contributed by NM, 15-May-1999.)
Assertion
Ref Expression
elimne0 if(𝐴 ≠ 0, 𝐴, 1) ≠ 0

Proof of Theorem elimne0
StepHypRef Expression
1 neeq1 3003 . 2 (𝐴 = if(𝐴 ≠ 0, 𝐴, 1) → (𝐴 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0))
2 neeq1 3003 . 2 (1 = if(𝐴 ≠ 0, 𝐴, 1) → (1 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0))
3 ax-1ne0 11041 . 2 1 ≠ 0
41, 2, 3elimhyp 4538 1 if(𝐴 ≠ 0, 𝐴, 1) ≠ 0
Colors of variables: wff setvar class
Syntax hints:  wne 2940  ifcif 4473  0cc0 10972  1c1 10973
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2707  ax-1ne0 11041
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1781  df-sb 2067  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2941  df-if 4474
This theorem is referenced by:  sqdivzi  33983
  Copyright terms: Public domain W3C validator