![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > naecoms-o | Structured version Visualization version GIF version |
Description: A commutation rule for distinct variable specifiers. Version of naecoms 2428 using ax-c11 37752. (Contributed by NM, 2-Jan-2002.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nalequcoms-o.1 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑) |
Ref | Expression |
---|---|
naecoms-o | ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | aecom-o 37766 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥) | |
2 | nalequcoms-o.1 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑) | |
3 | 1, 2 | nsyl4 158 | . 2 ⊢ (¬ 𝜑 → ∀𝑦 𝑦 = 𝑥) |
4 | 3 | con1i 147 | 1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1539 |
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-c5 37748 ax-c4 37749 ax-c7 37750 ax-c10 37751 ax-c11 37752 ax-c9 37755 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1782 |
This theorem is referenced by: ax12inda2ALT 37811 |
Copyright terms: Public domain | W3C validator |