| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > neneor | Structured version Visualization version GIF version | ||
| Description: If two classes are different, a third class must be different of at least one of them. (Contributed by Thierry Arnoux, 8-Aug-2020.) |
| Ref | Expression |
|---|---|
| neneor | ⊢ (𝐴 ≠ 𝐵 → (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqtr3 2787 | . . 3 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐵) | |
| 2 | 1 | necon3ai 2985 | . 2 ⊢ (𝐴 ≠ 𝐵 → ¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶)) |
| 3 | neorian 3055 | . 2 ⊢ ((𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶) ↔ ¬ (𝐴 = 𝐶 ∧ 𝐵 = 𝐶)) | |
| 4 | 2, 3 | sylibr 237 | 1 ⊢ (𝐴 ≠ 𝐵 → (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ≠ wne 2960 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ex 1813 df-cleq 2757 df-ne 2961 |
| This theorem is used by: wemapso2lem 9521 trgcopyeulem 29167 |
| Copyright terms: Public domain | W3C validator |