| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > necon2i | Structured version Visualization version GIF version | ||
| Description: Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.) |
| Ref | Expression |
|---|---|
| necon2i.1 | ⊢ (𝐴 = 𝐵 → 𝐶 ≠ 𝐷) |
| Ref | Expression |
|---|---|
| necon2i | ⊢ (𝐶 = 𝐷 → 𝐴 ≠ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | necon2i.1 | . . 3 ⊢ (𝐴 = 𝐵 → 𝐶 ≠ 𝐷) | |
| 2 | 1 | neneqd 2940 | . 2 ⊢ (𝐴 = 𝐵 → ¬ 𝐶 = 𝐷) |
| 3 | 2 | necon2ai 2964 | 1 ⊢ (𝐶 = 𝐷 → 𝐴 ≠ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ≠ wne 2935 |
| 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 208 df-ne 2936 |
| This theorem is referenced by: cmpfi 23398 mcubic 26836 cubic2 26837 2sqlem11 27417 zarcmplem 34072 ovoliunnfl 38036 voliunnfl 38038 volsupnfl 38039 mncn0 43591 aaitgo 43614 usgrexmpl2trifr 48535 |
| Copyright terms: Public domain | W3C validator |