New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > pm2.61ne | Unicode version |
Description: Deduction eliminating an inequality in an antecedent. (Contributed by NM, 24-May-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
Ref | Expression |
---|---|
pm2.61ne.1 | |
pm2.61ne.2 | |
pm2.61ne.3 |
Ref | Expression |
---|---|
pm2.61ne |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm2.61ne.2 | . . 3 | |
2 | 1 | expcom 424 | . 2 |
3 | nne 2521 | . . 3 | |
4 | pm2.61ne.3 | . . . 4 | |
5 | pm2.61ne.1 | . . . 4 | |
6 | 4, 5 | syl5ibr 212 | . . 3 |
7 | 3, 6 | sylbi 187 | . 2 |
8 | 2, 7 | pm2.61i 156 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 176 wa 358 wceq 1642 wne 2517 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 177 df-an 360 df-ne 2519 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |