| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > necon1bbii | Structured version Visualization version GIF version | ||
| Description: Contrapositive inference for inequality. (Contributed by NM, 17-Mar-2007.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
| Ref | Expression |
|---|---|
| necon1bbii.1 | ⊢ (𝐴 ≠ 𝐵 ↔ 𝜑) |
| Ref | Expression |
|---|---|
| necon1bbii | ⊢ (¬ 𝜑 ↔ 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nne 2934 | . 2 ⊢ (¬ 𝐴 ≠ 𝐵 ↔ 𝐴 = 𝐵) | |
| 2 | necon1bbii.1 | . 2 ⊢ (𝐴 ≠ 𝐵 ↔ 𝜑) | |
| 3 | 1, 2 | xchnxbi 332 | 1 ⊢ (¬ 𝜑 ↔ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 = wceq 1541 ≠ wne 2930 |
| 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 207 df-ne 2931 |
| This theorem is referenced by: necon2bbii 2981 intnex 5287 class2set 5297 csbopab 5500 modom 9145 supval2 9349 fzo0 13593 vma1 27113 lgsquadlem3 27330 ordtconnlem1 33948 |
| Copyright terms: Public domain | W3C validator |