Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > necon4ai | Structured version Visualization version GIF version |
Description: Contrapositive inference for inequality. (Contributed by NM, 16-Jan-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
Ref | Expression |
---|---|
necon4ai.1 | ⊢ (𝐴 ≠ 𝐵 → ¬ 𝜑) |
Ref | Expression |
---|---|
necon4ai | ⊢ (𝜑 → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | notnot 142 | . 2 ⊢ (𝜑 → ¬ ¬ 𝜑) | |
2 | necon4ai.1 | . . 3 ⊢ (𝐴 ≠ 𝐵 → ¬ 𝜑) | |
3 | 2 | necon1bi 2971 | . 2 ⊢ (¬ ¬ 𝜑 → 𝐴 = 𝐵) |
4 | 1, 3 | syl 17 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1539 ≠ wne 2942 |
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 2943 |
This theorem is referenced by: necon4i 2978 dmsn0el 6103 funsneqopb 7006 cfeq0 9943 |
Copyright terms: Public domain | W3C validator |