![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elimne0 | Structured version Visualization version GIF version |
Description: Hypothesis for weak deduction theorem to eliminate 𝐴 ≠ 0. (Contributed by NM, 15-May-1999.) |
Ref | Expression |
---|---|
elimne0 | ⊢ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neeq1 3049 | . 2 ⊢ (𝐴 = if(𝐴 ≠ 0, 𝐴, 1) → (𝐴 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0)) | |
2 | neeq1 3049 | . 2 ⊢ (1 = if(𝐴 ≠ 0, 𝐴, 1) → (1 ≠ 0 ↔ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0)) | |
3 | ax-1ne0 10595 | . 2 ⊢ 1 ≠ 0 | |
4 | 1, 2, 3 | elimhyp 4488 | 1 ⊢ if(𝐴 ≠ 0, 𝐴, 1) ≠ 0 |
Colors of variables: wff setvar class |
Syntax hints: ≠ wne 2987 ifcif 4425 0cc0 10526 1c1 10527 |
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 2113 ax-9 2121 ax-ext 2770 ax-1ne0 10595 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ne 2988 df-if 4426 |
This theorem is referenced by: sqdivzi 33072 |
Copyright terms: Public domain | W3C validator |