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 8546, 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 10861), and allows us 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 10861 | . 2 ⊢ ℂ = (R × R) | |
2 | qsid 8546 | . 2 ⊢ ((R × R) / ◡ E ) = (R × R) | |
3 | 1, 2 | eqtr4i 2770 | 1 ⊢ ℂ = ((R × R) / ◡ E ) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 E cep 5493 × cxp 5586 ◡ccnv 5587 / cqs 8471 Rcnr 10605 ℂcc 10853 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pr 5355 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-sb 2071 df-clab 2717 df-cleq 2731 df-clel 2817 df-ne 2945 df-ral 3070 df-rex 3071 df-rab 3074 df-v 3432 df-dif 3894 df-un 3896 df-in 3898 df-nul 4262 df-if 4465 df-sn 4567 df-pr 4569 df-op 4573 df-br 5079 df-opab 5141 df-eprel 5494 df-xp 5594 df-cnv 5596 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-ec 8474 df-qs 8478 df-c 10861 |
This theorem is referenced by: axmulcom 10895 axaddass 10896 axmulass 10897 axdistr 10898 |
Copyright terms: Public domain | W3C validator |