Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > neeq2i | Structured version Visualization version GIF version |
Description: Inference for inequality. (Contributed by NM, 29-Apr-2005.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
Ref | Expression |
---|---|
neeq1i.1 | ⊢ 𝐴 = 𝐵 |
Ref | Expression |
---|---|
neeq2i | ⊢ (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neeq1i.1 | . . 3 ⊢ 𝐴 = 𝐵 | |
2 | 1 | eqeq2i 2831 | . 2 ⊢ (𝐶 = 𝐴 ↔ 𝐶 = 𝐵) |
3 | 2 | necon3bii 3065 | 1 ⊢ (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 = wceq 1528 ≠ wne 3013 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-9 2115 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1772 df-cleq 2811 df-ne 3014 |
This theorem is referenced by: neeqtri 3085 omsucne 7587 suppvalbr 7823 upgr3v3e3cycl 27886 upgr4cycl4dv4e 27891 disjdsct 30364 divnumden2 30460 usgrgt2cycl 32274 nosgnn0 33062 |
Copyright terms: Public domain | W3C validator |