Theorem dfcnqs 7989

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

Syntax hints:   = wceq 1373   _E cep 4352   X. cxp 4691   `'ccnv 4692   /.cqs 6642   R.cnr 7445   CCcc 7958

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-eprel 4354  df-xp 4699  df-cnv 4701  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-ec 6645  df-qs 6649  df-c 7966

This theorem is referenced by:  axmulcom  8019  axaddass  8020  axmulass  8021  axdistr  8022