Theorem dfcnqs 8172

Description: Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in CC from those in R.. The trick involves qsid 6847, 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 8149), 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 8149	. 2 |- CC = ( R. X. R. )
2		qsid 6847	. 2 |- ( ( R. X. R. ) /. `' _E ) = ( R. X. R. )
3	1, 2	eqtr4i 2258	1 |- CC = ( ( R. X. R. ) /. `' _E )

Syntax hints:   = wceq 1398   _E cep 4413   X. cxp 4752   `'ccnv 4753   /.cqs 6779   R.cnr 7628   CCcc 8141

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-eprel 4415  df-xp 4760  df-cnv 4762  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-ec 6782  df-qs 6786  df-c 8149

This theorem is referenced by:  axmulcom  8202  axaddass  8203  axmulass  8204  axdistr  8205