| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equcomiv | Structured version Visualization version GIF version | ||
| Description: Weaker form of equcomi 2015 with a disjoint variable condition on 𝑥, 𝑦. This is an intermediate step and equcomi 2015 is fully recovered later. (Contributed by BJ, 7-Dec-2020.) |
| Ref | Expression |
|---|---|
| equcomiv | ⊢ (𝑥 = 𝑦 → 𝑦 = 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equid 2010 | . 2 ⊢ 𝑥 = 𝑥 | |
| 2 | ax7v2 2009 | . 2 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑥 → 𝑦 = 𝑥)) | |
| 3 | 1, 2 | mpi 20 | 1 ⊢ (𝑥 = 𝑦 → 𝑦 = 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 |
| This theorem depends on definitions: df-bi 207 df-ex 1779 |
| This theorem is referenced by: ax6evr 2013 |
| Copyright terms: Public domain | W3C validator |