| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equality theorem for partial ordering predicate. |
| Ref | Expression |
|---|---|
| poeq2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | poss 2847 |
. . . 4
| |
| 2 | poss 2847 |
. . . 4
| |
| 3 | 1, 2 | anim12i 333 |
. . 3
|
| 4 | eqss 2080 |
. . 3
| |
| 5 | dfbi2 516 |
. . 3
| |
| 6 | 3, 4, 5 | 3imtr4 219 |
. 2
|
| 7 | 6 | bicomd 523 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-10 968 ax-12 970 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-3an 779 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-ral 1652 df-in 2054 df-ss 2056 df-po 2846 |