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 2027 adapted to common usage. (Contributed by Wolf Lammen, 8-Sep-2018.) |
Ref | Expression |
---|---|
equvinva | ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax6evr 2013 | . 2 ⊢ ∃𝑧 𝑦 = 𝑧 | |
2 | equtr 2019 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → 𝑥 = 𝑧)) | |
3 | 2 | ancrd 552 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑦 = 𝑧 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑧))) |
4 | 3 | eximdv 1909 | . 2 ⊢ (𝑥 = 𝑦 → (∃𝑧 𝑦 = 𝑧 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧))) |
5 | 1, 4 | mpi 20 | 1 ⊢ (𝑥 = 𝑦 → ∃𝑧(𝑥 = 𝑧 ∧ 𝑦 = 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∃wex 1771 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 |
This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1772 |
This theorem is referenced by: sbequ2 2240 sbequ2OLD 2241 ax13lem1 2383 nfeqf 2390 wl-ax13lem1 34628 |
Copyright terms: Public domain | W3C validator |