| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > equcoms | Unicode version | ||
| Description: An inference commuting equality in antecedent. Used to eliminate the need for a syllogism. (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| equcoms.1 |
|
| Ref | Expression |
|---|---|
| equcoms |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equcomi 1756 |
. 2
| |
| 2 | equcoms.1 |
. 2
| |
| 3 | 1, 2 | syl 14 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-gen 1502 ax-ie2 1547 ax-8 1557 ax-17 1579 ax-i9 1583 |
| This theorem depends on definitions: df-bi 117 |
| This theorem is referenced by: equtr 1761 equtr2 1763 equequ2 1765 ax10o 1767 cbvalv1 1804 cbvexv1 1805 cbvalh 1806 cbvexh 1808 equvini 1811 stdpc7 1823 sbequ12r 1825 sbequ12a 1826 sbequ 1893 sb6rf 1906 cbvalvw 1975 cbvexvw 1976 sb9v 2038 sb6a 2048 mo2n 2114 elequ1 2213 elequ2 2214 cleqh 2338 cbvab 2364 sbralie 2804 reu8 3022 sbcco2 3074 reu8nf 3133 snnex 4589 tfisi 4729 opeliunxp 4825 elrnmpt1 5028 rnxpid 5217 iotaval 5344 elabrex 5953 elabrexg 5954 opabex3d 6340 opabex3 6341 enq0ref 7790 fproddivapf 12376 setindis 16907 bdsetindis 16909 |
| Copyright terms: Public domain | W3C validator |