| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > aev-o | Structured version Visualization version GIF version | ||
| Description: A "distinctor elimination" lemma with no disjoint variable conditions on variables in the consequent, proved without using ax-c16 40043. Version of aev 2091 using ax-c11 40038. (Contributed by NM, 8-Nov-2006.) (Proof shortened by Andrew Salmon, 21-Jun-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| aev-o | ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧 𝑤 = 𝑣) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hbae-o 40054 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦) | |
| 2 | hbae-o 40054 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑡∀𝑥 𝑥 = 𝑦) | |
| 3 | ax7 2048 | . . . . 5 ⊢ (𝑥 = 𝑡 → (𝑥 = 𝑦 → 𝑡 = 𝑦)) | |
| 4 | 3 | spimvw 2018 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑡 = 𝑦) |
| 5 | 2, 4 | alrimih 1856 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑡 𝑡 = 𝑦) |
| 6 | ax7 2048 | . . . . . . . 8 ⊢ (𝑦 = 𝑢 → (𝑦 = 𝑡 → 𝑢 = 𝑡)) | |
| 7 | equcomi 2049 | . . . . . . . 8 ⊢ (𝑢 = 𝑡 → 𝑡 = 𝑢) | |
| 8 | 6, 7 | syl6 36 | . . . . . . 7 ⊢ (𝑦 = 𝑢 → (𝑦 = 𝑡 → 𝑡 = 𝑢)) |
| 9 | 8 | spimvw 2018 | . . . . . 6 ⊢ (∀𝑦 𝑦 = 𝑡 → 𝑡 = 𝑢) |
| 10 | 9 | aecoms-o 40053 | . . . . 5 ⊢ (∀𝑡 𝑡 = 𝑦 → 𝑡 = 𝑢) |
| 11 | 10 | axc4i-o 40049 | . . . 4 ⊢ (∀𝑡 𝑡 = 𝑦 → ∀𝑡 𝑡 = 𝑢) |
| 12 | hbae-o 40054 | . . . . 5 ⊢ (∀𝑡 𝑡 = 𝑢 → ∀𝑣∀𝑡 𝑡 = 𝑢) | |
| 13 | ax7 2048 | . . . . . 6 ⊢ (𝑡 = 𝑣 → (𝑡 = 𝑢 → 𝑣 = 𝑢)) | |
| 14 | 13 | spimvw 2018 | . . . . 5 ⊢ (∀𝑡 𝑡 = 𝑢 → 𝑣 = 𝑢) |
| 15 | 12, 14 | alrimih 1856 | . . . 4 ⊢ (∀𝑡 𝑡 = 𝑢 → ∀𝑣 𝑣 = 𝑢) |
| 16 | aecom-o 40052 | . . . 4 ⊢ (∀𝑣 𝑣 = 𝑢 → ∀𝑢 𝑢 = 𝑣) | |
| 17 | 11, 15, 16 | 3syl 19 | . . 3 ⊢ (∀𝑡 𝑡 = 𝑦 → ∀𝑢 𝑢 = 𝑣) |
| 18 | ax7 2048 | . . . 4 ⊢ (𝑢 = 𝑤 → (𝑢 = 𝑣 → 𝑤 = 𝑣)) | |
| 19 | 18 | spimvw 2018 | . . 3 ⊢ (∀𝑢 𝑢 = 𝑣 → 𝑤 = 𝑣) |
| 20 | 5, 17, 19 | 3syl 19 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝑤 = 𝑣) |
| 21 | 1, 20 | alrimih 1856 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧 𝑤 = 𝑣) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1567 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-11 2193 ax-c5 40034 ax-c4 40035 ax-c7 40036 ax-c10 40037 ax-c11 40038 ax-c9 40041 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 |
| This theorem is used by: axc16g-o 40085 |
| Copyright terms: Public domain | W3C validator |