Theorem dfcnqs 7642

Description: Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in CC from those in R.. The trick involves qsid 6487, 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 CC is a quotient set, even though it is not (compare df-c 7619), 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.)

Assertion

Ref	Expression
dfcnqs	|- CC = ( ( R. X. R. ) /. `' _E )

Proof of Theorem dfcnqs

Step	Hyp	Ref	Expression
1		df-c 7619	. 2 |- CC = ( R. X. R. )
2		qsid 6487	. 2 |- ( ( R. X. R. ) /. `' _E ) = ( R. X. R. )
3	1, 2	eqtr4i 2161	1 |- CC = ( ( R. X. R. ) /. `' _E )

Syntax hints:   = wceq 1331   _E cep 4204   X. cxp 4532   `'ccnv 4533   /.cqs 6421   R.cnr 7098   CCcc 7611

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-eprel 4206  df-xp 4540  df-cnv 4542  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-ec 6424  df-qs 6428  df-c 7619

This theorem is referenced by:  axmulcom  7672  axaddass  7673  axmulass  7674  axdistr  7675