Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-erq | Structured version Visualization version Unicode version |
Description: Define a convenience function that "reduces" a fraction to lowest terms. Note that in this form, it is not obviously a function; we prove this in nqerf 9752. (Contributed by NM, 27-Aug-1995.) (New usage is discouraged.) |
Ref | Expression |
---|---|
df-erq |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cerq 9676 | . 2 | |
2 | ceq 9673 | . . 3 | |
3 | cnpi 9666 | . . . . 5 | |
4 | 3, 3 | cxp 5112 | . . . 4 |
5 | cnq 9674 | . . . 4 | |
6 | 4, 5 | cxp 5112 | . . 3 |
7 | 2, 6 | cin 3573 | . 2 |
8 | 1, 7 | wceq 1483 | 1 |
Colors of variables: wff setvar class |
This definition is referenced by: nqerf 9752 nqerrel 9754 nqerid 9755 |
Copyright terms: Public domain | W3C validator |