| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfcnqs | 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 6864, which shows that the coset of the converse epsilon 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 8175), 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.) |
| Ref | Expression |
|---|---|
| dfcnqs | ⊢ ℂ = ((R × R) / ◡ E ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-c 8175 | . 2 ⊢ ℂ = (R × R) | |
| 2 | qsid 6864 | . 2 ⊢ ((R × R) / ◡ E ) = (R × R) | |
| 3 | 1, 2 | eqtr4i 2262 | 1 ⊢ ℂ = ((R × R) / ◡ E ) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1402 E cep 4427 × cxp 4767 ◡ccnv 4768 / cqs 6796 Rcnr 7654 ℂcc 8167 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-br 4126 df-opab 4188 df-eprel 4429 df-xp 4775 df-cnv 4777 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-ec 6799 df-qs 6803 df-c 8175 |
| This theorem is referenced by: axmulcom 8228 axaddass 8229 axmulass 8230 axdistr 8231 |
| Copyright terms: Public domain | W3C validator |