| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > df-erq | Structured version Visualization version GIF 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 10942. (Contributed by NM, 27-Aug-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| df-erq | ⊢ [Q] = ( ~Q ∩ ((N × N) × Q)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cerq 10866 | . 2 class [Q] | |
| 2 | ceq 10863 | . . 3 class ~Q | |
| 3 | cnpi 10856 | . . . . 5 class N | |
| 4 | 3, 3 | cxp 5652 | . . . 4 class (N × N) |
| 5 | cnq 10864 | . . . 4 class Q | |
| 6 | 4, 5 | cxp 5652 | . . 3 class ((N × N) × Q) |
| 7 | 2, 6 | cin 3925 | . 2 class ( ~Q ∩ ((N × N) × Q)) |
| 8 | 1, 7 | wceq 1540 | 1 wff [Q] = ( ~Q ∩ ((N × N) × Q)) |
| Colors of variables: wff setvar class |
| This definition is referenced by: nqerf 10942 nqerrel 10944 nqerid 10945 |
| Copyright terms: Public domain | W3C validator |