![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sylan9req | Unicode version |
Description: An equality transitivity deduction. (Contributed by NM, 23-Jun-2007.) |
Ref | Expression |
---|---|
sylan9req.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
sylan9req.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
sylan9req |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sylan9req.1 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | 1 | eqcomd 2045 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | sylan9req.2 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 2, 3 | sylan9eq 2092 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 ax-4 1400 ax-17 1419 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-cleq 2033 |
This theorem is referenced by: xpid11m 4557 fndmu 5000 fodmrnu 5114 funcoeqres 5157 fvunsng 5357 prarloclem5 6598 addlocprlemeq 6631 zdiv 8328 resqrexlemnm 9616 |
Copyright terms: Public domain | W3C validator |