Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2ax6e | Structured version Visualization version Unicode version |
Description: We can always find values matching and , as long as they are represented by distinct variables. Version of 2ax6elem 2449 with a distinct variable constraint. (Contributed by Wolf Lammen, 28-Sep-2018.) |
Ref | Expression |
---|---|
2ax6e |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | aeveq 1982 | . . . 4 | |
2 | aeveq 1982 | . . . 4 | |
3 | 1, 2 | jca 554 | . . 3 |
4 | 19.8a 2052 | . . 3 | |
5 | 19.8a 2052 | . . 3 | |
6 | 3, 4, 5 | 3syl 18 | . 2 |
7 | 2ax6elem 2449 | . 2 | |
8 | 6, 7 | pm2.61i 176 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wa 384 wal 1481 wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 |
This theorem is referenced by: 2sb5rf 2451 2sb6rf 2452 |
Copyright terms: Public domain | W3C validator |