| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqeqan12d | Unicode version | ||
| Description: A useful inference for substituting definitions into an equality. (Contributed by NM, 9-Aug-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
| Ref | Expression |
|---|---|
| eqeqan12d.1 |
|
| eqeqan12d.2 |
|
| Ref | Expression |
|---|---|
| eqeqan12d |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeqan12d.1 |
. 2
| |
| 2 | eqeqan12d.2 |
. 2
| |
| 3 | eqeq12 2251 |
. 2
| |
| 4 | 1, 2, 3 | syl2an 289 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-gen 1502 ax-4 1563 ax-17 1579 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-cleq 2231 |
| This theorem is used by: eqeqan12rd 2255 eqfnfv 5806 eqfnfv2 5807 f1mpt 5977 xpopth 6410 f1o2ndf1 6464 ecopoveq 6904 xpdom2 7129 djune 7418 addpipqqs 7737 enq0enq 7798 enq0sym 7799 enq0tr 7801 enq0breq 7803 preqlu 7839 cnegexlem1 8501 neg11 8577 subeqrev 8702 cnref1o 10051 xneg11 10236 modlteq 10834 sq11 11049 qsqeqor 11087 fz1eqb 11229 eqwrd 11345 s111 11399 ccatopth 11488 wrd2ind 11495 cj11 11671 sqrt11 11805 sqabs 11848 recan 11875 reeff1 12467 efieq 12502 xpsff1o 13670 ismhm 13768 isdomn 14578 tgtop11 15177 ioocosf1o 15955 mpodvdsmulf1o 16104 iswlk 16564 |
| Copyright terms: Public domain | W3C validator |