![]() |
Higher-Order Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HOLE Home > Th. List > 3eqtr3i | Unicode version |
Description: Transitivity of equality. (Contributed by Mario Carneiro, 7-Oct-2014.) |
Ref | Expression |
---|---|
3eqtr4i.1 |
![]() ![]() ![]() ![]() |
3eqtr4i.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3eqtr3i.3 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3eqtr3i.4 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
3eqtr3i |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3eqtr4i.1 |
. 2
![]() ![]() ![]() ![]() | |
2 | 3eqtr4i.2 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 3eqtr3i.3 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 1, 3 | eqcomi 79 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
5 | 1, 2 | eqtypi 78 |
. . 3
![]() ![]() ![]() ![]() |
6 | 3eqtr3i.4 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
7 | 5, 6 | eqcomi 79 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
8 | 1, 2, 4, 7 | 3eqtr4i 96 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: type var term |
Syntax hints: ![]() ![]() ![]() |
This theorem was proved from axioms: ax-syl 15 ax-jca 17 ax-trud 26 ax-cb1 29 ax-cb2 30 ax-weq 40 ax-refl 42 ax-eqmp 45 ax-wc 49 ax-ceq 51 ax-wov 71 ax-eqtypi 77 ax-eqtypri 80 |
This theorem depends on definitions: df-ov 73 |
This theorem is referenced by: dfan2 154 cbvf 179 leqf 181 axext 219 |
Copyright terms: Public domain | W3C validator |