| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > aecoms | Structured version Visualization version GIF version | ||
| Description: A commutation rule for identical variable specifiers. Usage of this theorem is discouraged because it depends on ax-13 2405. (Contributed by NM, 10-May-1993.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| aecoms.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) |
| Ref | Expression |
|---|---|
| aecoms | ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aecom 2460 | . 2 ⊢ (∀𝑦 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦) | |
| 2 | aecoms.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) | |
| 3 | 1, 2 | sylbi 219 | 1 ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1560 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-10 2177 ax-12 2214 ax-13 2405 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1802 df-nf 1806 |
| This theorem is referenced by: axc11 2463 nd4 10550 axrepnd 10554 axpownd 10561 axregnd 10564 axinfnd 10566 axacndlem5 10571 axacnd 10572 e2ebind 45144 |
| Copyright terms: Public domain | W3C validator |