New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > neorian | GIF version |
Description: A De Morgan's law for inequality. (Contributed by NM, 18-May-2007.) |
Ref | Expression |
---|---|
neorian | ⊢ ((A ≠ B ∨ C ≠ D) ↔ ¬ (A = B ∧ C = D)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ne 2519 | . . 3 ⊢ (A ≠ B ↔ ¬ A = B) | |
2 | df-ne 2519 | . . 3 ⊢ (C ≠ D ↔ ¬ C = D) | |
3 | 1, 2 | orbi12i 507 | . 2 ⊢ ((A ≠ B ∨ C ≠ D) ↔ (¬ A = B ∨ ¬ C = D)) |
4 | ianor 474 | . 2 ⊢ (¬ (A = B ∧ C = D) ↔ (¬ A = B ∨ ¬ C = D)) | |
5 | 3, 4 | bitr4i 243 | 1 ⊢ ((A ≠ B ∨ C ≠ D) ↔ ¬ (A = B ∧ C = D)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 176 ∨ wo 357 ∧ wa 358 = wceq 1642 ≠ wne 2517 |
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 177 df-or 359 df-an 360 df-ne 2519 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |