| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduction eliminating an inequality in an antecedent. |
| Ref | Expression |
|---|---|
| pm2.61dane.1 |
|
| pm2.61dane.2 |
|
| Ref | Expression |
|---|---|
| pm2.61dane |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.61dane.1 |
. . 3
| |
| 2 | 1 | ex 402 |
. 2
|
| 3 | pm2.61dane.2 |
. . 3
| |
| 4 | 3 | ex 402 |
. 2
|
| 5 | 2, 4 | pm2.61dne 2091 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: mulc1cncf 8541 atcvrj2b 17069 atltcvr 17072 ps2 17079 pmodlem1 17307 pmapjat 17314 osumcl 17375 pexmidOLD 17386 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |
| This theorem depends on definitions: df-bi 164 df-an 242 df-ne 2019 |