| 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 2402. (Contributed by NM, 10-May-1993.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| aecoms.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) |
| Ref | Expression |
|---|---|
| aecoms | ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aecom 2457 | . 2 ⊢ (∀𝑦 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦) | |
| 2 | aecoms.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑) | |
| 3 | 1, 2 | sylbi 220 | 1 ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1566 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-10 2174 ax-12 2211 ax-13 2402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1808 df-nf 1812 |
| This theorem is referenced by: axc11 2460 nd4 10574 axrepnd 10578 axpownd 10585 axregnd 10588 axinfnd 10590 axacndlem5 10595 axacnd 10596 e2ebind 45242 |
| Copyright terms: Public domain | W3C validator |