Theorem dfcnqs 8060

Description: Technical trick to permit reuse of previous lemmas to prove arithmetic operation laws in ℂ from those in R. The trick involves qsid 6768, 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 8037), 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	⊢ ℂ = ((R × R) / ◡ E )

Proof of Theorem dfcnqs

Step	Hyp	Ref	Expression
1		df-c 8037	. 2 ⊢ ℂ = (R × R)
2		qsid 6768	. 2 ⊢ ((R × R) / ◡ E ) = (R × R)
3	1, 2	eqtr4i 2255	1 ⊢ ℂ = ((R × R) / ◡ E )

Syntax hints:   = wceq 1397   E cep 4384   × cxp 4723  ^◡ccnv 4724   / cqs 6700  Rcnr 7516  ℂcc 8029

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-eprel 4386  df-xp 4731  df-cnv 4733  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-ec 6703  df-qs 6707  df-c 8037

This theorem is referenced by:  axmulcom  8090  axaddass  8091  axmulass  8092  axdistr  8093