| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > necon4bid | Structured version Visualization version GIF version | ||
| Description: Contrapositive law deduction for inequality. (Contributed by NM, 29-Jun-2007.) |
| Ref | Expression |
|---|---|
| necon4bid.1 | ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)) |
| Ref | Expression |
|---|---|
| necon4bid | ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | necon4bid.1 | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)) | |
| 2 | 1 | necon2bbid 2976 | . 2 ⊢ (𝜑 → (𝐶 = 𝐷 ↔ ¬ 𝐴 ≠ 𝐵)) |
| 3 | nne 2937 | . 2 ⊢ (¬ 𝐴 ≠ 𝐵 ↔ 𝐴 = 𝐵) | |
| 4 | 2, 3 | bitr2di 288 | 1 ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 = wceq 1540 ≠ wne 2933 |
| 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 2934 |
| This theorem is referenced by: nebi 3013 rpexp 16746 norm-i 31115 trlid0b 40202 oduoppcciso 49410 |
| Copyright terms: Public domain | W3C validator |