![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > neqcomd | Structured version Visualization version GIF version |
Description: Commute an inequality. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
Ref | Expression |
---|---|
neqcomd.1 | ⊢ (𝜑 → ¬ 𝐴 = 𝐵) |
Ref | Expression |
---|---|
neqcomd | ⊢ (𝜑 → ¬ 𝐵 = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neqcomd.1 | . 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐵) | |
2 | eqcom 2739 | . 2 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
3 | 1, 2 | sylnib 327 | 1 ⊢ (𝜑 → ¬ 𝐵 = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 = wceq 1541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1782 df-cleq 2724 |
This theorem is referenced by: phpeqd 9214 phpeqdOLD 9224 simpgnsgd 19969 aks4d1p8d2 40945 selvvvval 41159 rr-phpd 42952 |
Copyright terms: Public domain | W3C validator |