Theorem qsid 8780

Description: A set is equal to its quotient set modulo the converse membership relation. (Note: the converse membership relation is not an equivalence relation.) (Contributed by NM, 13-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.)

Assertion

Ref	Expression
qsid	⊢ (𝐴 / ◡ E ) = 𝐴

Proof of Theorem qsid

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3459	. . . . . . 7 ⊢ 𝑥 ∈ V
2	1	ecid 8779	. . . . . 6 ⊢ [𝑥]◡ E = 𝑥
3	2	eqeq2i 2776	. . . . 5 ⊢ (𝑦 = [𝑥]◡ E ↔ 𝑦 = 𝑥)
4		equcom 2048	. . . . 5 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦)
5	3, 4	bitri 278	. . . 4 ⊢ (𝑦 = [𝑥]◡ E ↔ 𝑥 = 𝑦)
6	5	rexbii 3112	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = [𝑥]◡ E ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦)
7		vex 3459	. . . 4 ⊢ 𝑦 ∈ V
8	7	elqs 8763	. . 3 ⊢ (𝑦 ∈ (𝐴 / ◡ E ) ↔ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]◡ E )
9		risset 3240	. . 3 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦)
10	6, 8, 9	3bitr4i 306	. 2 ⊢ (𝑦 ∈ (𝐴 / ◡ E ) ↔ 𝑦 ∈ 𝐴)
11	10	eqriv 2760	1 ⊢ (𝐴 / ◡ E ) = 𝐴

Syntax hints:   = wceq 1570   ∈ wcel 2143  ∃wrex 3089   E cep 5562  ^◡ccnv 5662  [cec 8693   / cqs 8694

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-eprel 5563  df-xp 5669  df-cnv 5671  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ec 8697  df-qs 8701

This theorem is referenced by:  dfcnqs  11128  cnvepima  38964  n0elim  39362