| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfcnqs | Structured version Visualization version GIF version | ||
| Description: Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in ℂ from those in R. The trick involves qsid 8718, which shows that the coset of the converse membership relation (which is not an equivalence relation) acts as an identity divisor for the quotient set operation. This lets us "pretend" that ℂ is a quotient set, even though it is not (compare df-c 11032), and allows to reuse some of the equivalence class lemmas we developed for the transition from positive reals to signed reals, etc. (Contributed by NM, 13-Aug-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dfcnqs | ⊢ ℂ = ((R × R) / ◡ E ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-c 11032 | . 2 ⊢ ℂ = (R × R) | |
| 2 | qsid 8718 | . 2 ⊢ ((R × R) / ◡ E ) = (R × R) | |
| 3 | 1, 2 | eqtr4i 2762 | 1 ⊢ ℂ = ((R × R) / ◡ E ) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 E cep 5523 × cxp 5622 ◡ccnv 5623 / cqs 8634 Rcnr 10776 ℂcc 11024 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-eprel 5524 df-xp 5630 df-cnv 5632 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ec 8637 df-qs 8641 df-c 11032 |
| This theorem is referenced by: axmulcom 11066 axaddass 11067 axmulass 11068 axdistr 11069 |
| Copyright terms: Public domain | W3C validator |