Home | Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
Description: Theorem *3.47 of [WhiteheadRussell] p. 113. It was proved by Leibniz, and it evidently pleased him enough to call it 'praeclarum theorema' (splendid theorem). (The proof was shortened by Wolf Lammen, 7-Apr-2013.) |
Ref | Expression |
---|---|
prth |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 465 | . 2 | |
2 | simpr 469 | . 2 | |
3 | 1, 2 | anim12d 571 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 382 |
This theorem is referenced by: mo 1872 2mo 1929 euind 2519 reuind 2530 reuss2 2920 opelopabt 3599 reusv3i 3854 tfrlem5 5305 spanuni 12593 pm11.71 16982 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-3 7 ax-mp 8 |
This theorem depends on definitions: df-bi 190 df-an 384 |