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 6566, 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 7759), 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 7759 | . 2 ⊢ ℂ = (R × R) | |
2 | qsid 6566 | . 2 ⊢ ((R × R) / ◡ E ) = (R × R) | |
3 | 1, 2 | eqtr4i 2189 | 1 ⊢ ℂ = ((R × R) / ◡ E ) |
Colors of variables: wff set class |
Syntax hints: = wceq 1343 E cep 4265 × cxp 4602 ◡ccnv 4603 / cqs 6500 Rcnr 7238 ℂcc 7751 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-sbc 2952 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-eprel 4267 df-xp 4610 df-cnv 4612 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-ec 6503 df-qs 6507 df-c 7759 |
This theorem is referenced by: axmulcom 7812 axaddass 7813 axmulass 7814 axdistr 7815 |
Copyright terms: Public domain | W3C validator |