| 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 2372. (Contributed by NM, 10-May-1993.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| aecoms.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) |
| Ref | Expression |
|---|---|
| aecoms | ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aecom 2427 | . 2 ⊢ (∀𝑦 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦) | |
| 2 | aecoms.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) | |
| 3 | 1, 2 | sylbi 217 | 1 ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1539 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-10 2144 ax-12 2180 ax-13 2372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-nf 1785 |
| This theorem is referenced by: axc11 2430 nd4 10481 axrepnd 10485 axpownd 10492 axregnd 10495 axinfnd 10497 axacndlem5 10502 axacnd 10503 wl-ax11-lem1 37627 wl-ax11-lem3 37629 wl-ax11-lem9 37635 wl-ax11-lem10 37636 e2ebind 44604 |
| Copyright terms: Public domain | W3C validator |