| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51. |
| Ref | Expression |
|---|---|
| cotr |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 1502 |
. . . . . . . 8
| |
| 2 | df-br 2063 |
. . . . . . . 8
| |
| 3 | 1, 2 | syl6ibr 186 |
. . . . . . 7
|
| 4 | opabid 2099 |
. . . . . . 7
| |
| 5 | 3, 4 | syl5ibr 182 |
. . . . . 6
|
| 6 | df-co 2427 |
. . . . . . 7
| |
| 7 | 6 | sseq1i 1524 |
. . . . . 6
|
| 8 | 19.23v 950 |
. . . . . 6
| |
| 9 | 5, 7, 8 | 3imtr4 192 |
. . . . 5
|
| 10 | 9 | 19.21aiv 943 |
. . . 4
|
| 11 | alcom 715 |
. . . 4
| |
| 12 | 10, 11 | sylibr 175 |
. . 3
|
| 13 | 12 | 19.21aiv 943 |
. 2
|
| 14 | ssopab2 2119 |
. . . . 5
| |
| 15 | 8 | bial 695 |
. . . . . . 7
|
| 16 | 11, 15 | bitr 151 |
. . . . . 6
|
| 17 | 16 | bial 695 |
. . . . 5
|
| 18 | 14, 17 | bitr4 154 |
. . . 4
|
| 19 | opabss 2100 |
. . . . 5
| |
| 20 | sstr2 1510 |
. . . . 5
| |
| 21 | 19, 20 | mpi 44 |
. . . 4
|
| 22 | 18, 21 | sylbir 176 |
. . 3
|
| 23 | 22, 6 | syl5ss 1544 |
. 2
|
| 24 | 13, 23 | impbi 139 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: er2 3201 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-br 2063 df-opab 2098 df-co 2427 |