| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > equvinva | Structured version Visualization version GIF version | ||
| Description: A modified version of the forward implication of equvinv 2037 adapted to common usage. (Contributed by Wolf Lammen, 8-Sep-2018.) |
| Ref | Expression |
|---|---|
| equvinva | ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax6evr 2023 | . 2 ⊢ ∃𝑧 𝑦 = 𝑧 | |
| 2 | equtr 2029 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) | |
| 3 | 2 | ancrd 557 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑧))) |
| 4 | 3 | eximdv 1925 | . 2 ⊢ (𝑥 = 𝑦 → (∃𝑧 𝑦 = 𝑧 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧))) |
| 5 | 1, 4 | mpi 20 | 1 ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∃wex 1787 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-ex 1788 |
| This theorem is referenced by: sbequ2 2263 ax13lem1 2384 nfeqf 2391 wl-ax13lem1 37871 |
| Copyright terms: Public domain | W3C validator |