Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axc11nlemOLD2 | Structured version Visualization version GIF version |
Description: Lemma for axc11n 2295. Change bound variable in an equality. Obsolete as of 29-Mar-2021. Use aev 1970 instead. (Contributed by NM, 8-Jul-2016.) (Proof shortened by Wolf Lammen, 17-Feb-2018.) Restructure to ease either bundling, or reducing dependencies on axioms. (Revised by Wolf Lammen, 30-Nov-2019.) Remove dependency on ax-12 2034. (Revised by Wolf Lammen, 14-Mar-2021.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
axc11nlemOLD2.1 | ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)) |
Ref | Expression |
---|---|
axc11nlemOLD2 | ⊢ (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvaev 1966 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧) | |
2 | equequ2 1940 | . . . . 5 ⊢ (𝑥 = 𝑧 → (𝑦 = 𝑥 ↔ 𝑦 = 𝑧)) | |
3 | 2 | biimprd 237 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑦 = 𝑧 → 𝑦 = 𝑥)) |
4 | 3 | al2imi 1733 | . . 3 ⊢ (∀𝑦 𝑥 = 𝑧 → (∀𝑦 𝑦 = 𝑧 → ∀𝑦 𝑦 = 𝑥)) |
5 | 1, 4 | syl5com 31 | . 2 ⊢ (∀𝑥 𝑥 = 𝑧 → (∀𝑦 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑥)) |
6 | spaev 1965 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑧 → 𝑥 = 𝑧) | |
7 | axc11nlemOLD2.1 | . . . 4 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 = 𝑧 → ∀𝑦 𝑥 = 𝑧)) | |
8 | 6, 7 | syl5com 31 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑧 → (¬ ∀𝑦 𝑦 = 𝑥 → ∀𝑦 𝑥 = 𝑧)) |
9 | 8 | con1d 138 | . 2 ⊢ (∀𝑥 𝑥 = 𝑧 → (¬ ∀𝑦 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑥)) |
10 | 5, 9 | pm2.61d 169 | 1 ⊢ (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∀wal 1473 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 |
This theorem depends on definitions: df-bi 196 df-an 385 df-ex 1696 |
This theorem is referenced by: aevlemOLD 1976 axc11nOLDOLD 2297 |
Copyright terms: Public domain | W3C validator |