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

Theorem elimne0 11213
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 3022 . 2 (𝐴 = if(𝐴 ≠ 0, 𝐴, 1) → (𝐴 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0))
2 neeq1 3022 . 2 (1 = if(𝐴 ≠ 0, 𝐴, 1) → (1 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0))
3 ax-1ne0 11186 . 2 1 ≠ 0
41, 2, 3elimhyp 4555 1 if(𝐴 ≠ 0, 𝐴, 1) ≠ 0
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wne 2960  ifcif 4489  0cc0 11117  1c1 11118
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-1ne0 11186
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-if 4490
This theorem is used by:  sqdivzi  36259
  Copyright terms: Public domain W3C validator