Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > necon1i | Structured version Visualization version GIF version |
Description: Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.) |
Ref | Expression |
---|---|
necon1i.1 | ⊢ (𝐴 ≠ 𝐵 → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
necon1i | ⊢ (𝐶 ≠ 𝐷 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ne 2944 | . . 3 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵) | |
2 | necon1i.1 | . . 3 ⊢ (𝐴 ≠ 𝐵 → 𝐶 = 𝐷) | |
3 | 1, 2 | sylbir 234 | . 2 ⊢ (¬ 𝐴 = 𝐵 → 𝐶 = 𝐷) |
4 | 3 | necon1ai 2971 | 1 ⊢ (𝐶 ≠ 𝐷 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1539 ≠ wne 2943 |
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 206 df-ne 2944 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |