Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2ax6e | Structured version Visualization version GIF version |
Description: We can always find values matching 𝑥 and 𝑦, as long as they are represented by distinct variables. Version of 2ax6elem 2493 with a distinct variable constraint. Usage of this theorem is discouraged because it depends on ax-13 2390. (Contributed by Wolf Lammen, 28-Sep-2018.) (Proof shortened by Wolf Lammen, 3-Oct-2023.) (New usage is discouraged.) |
Ref | Expression |
---|---|
2ax6e | ⊢ ∃𝑧∃𝑤(𝑧 = 𝑥 ∧ 𝑤 = 𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | aeveq 2061 | . . . . 5 ⊢ (∀𝑤 𝑤 = 𝑧 → 𝑧 = 𝑥) | |
2 | aeveq 2061 | . . . . 5 ⊢ (∀𝑤 𝑤 = 𝑧 → 𝑤 = 𝑦) | |
3 | 1, 2 | jca 514 | . . . 4 ⊢ (∀𝑤 𝑤 = 𝑧 → (𝑧 = 𝑥 ∧ 𝑤 = 𝑦)) |
4 | 3 | 19.8ad 2181 | . . 3 ⊢ (∀𝑤 𝑤 = 𝑧 → ∃𝑤(𝑧 = 𝑥 ∧ 𝑤 = 𝑦)) |
5 | 4 | 19.8ad 2181 | . 2 ⊢ (∀𝑤 𝑤 = 𝑧 → ∃𝑧∃𝑤(𝑧 = 𝑥 ∧ 𝑤 = 𝑦)) |
6 | 2ax6elem 2493 | . 2 ⊢ (¬ ∀𝑤 𝑤 = 𝑧 → ∃𝑧∃𝑤(𝑧 = 𝑥 ∧ 𝑤 = 𝑦)) | |
7 | 5, 6 | pm2.61i 184 | 1 ⊢ ∃𝑧∃𝑤(𝑧 = 𝑥 ∧ 𝑤 = 𝑦) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∀wal 1535 ∃wex 1780 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-10 2145 ax-11 2161 ax-12 2177 ax-13 2390 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 |
This theorem is referenced by: 2sb5rf 2496 2sb6rf 2497 |
Copyright terms: Public domain | W3C validator |