Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pm2.61dda | Structured version Visualization version Unicode version |
Description: Elimination of two antecedents. (Contributed by NM, 9-Jul-2013.) |
Ref | Expression |
---|---|
pm2.61dda.1 | |
pm2.61dda.2 | |
pm2.61dda.3 |
Ref | Expression |
---|---|
pm2.61dda |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm2.61dda.3 | . . . 4 | |
2 | 1 | anassrs 680 | . . 3 |
3 | pm2.61dda.2 | . . . 4 | |
4 | 3 | adantlr 751 | . . 3 |
5 | 2, 4 | pm2.61dan 832 | . 2 |
6 | pm2.61dda.1 | . 2 | |
7 | 5, 6 | pm2.61dan 832 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wa 384 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 197 df-an 386 |
This theorem is referenced by: lhpexle1lem 35293 lclkrlem2x 36819 |
Copyright terms: Public domain | W3C validator |