Theorem dfcnqs 8039

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

Syntax hints:   = wceq 1395   E cep 4378   × cxp 4717  ^◡ccnv 4718   / cqs 6687  Rcnr 7495  ℂcc 8008

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-eprel 4380  df-xp 4725  df-cnv 4727  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-ec 6690  df-qs 6694  df-c 8016

This theorem is referenced by:  axmulcom  8069  axaddass  8070  axmulass  8071  axdistr  8072