Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > qsid | GIF version |
Description: A set is equal to its quotient set mod converse epsilon. (Note: converse epsilon is not an equivalence relation.) (Contributed by NM, 13-Aug-1995.) (Revised by Mario Carneiro, 9-Jul-2014.) |
Ref | Expression |
---|---|
qsid | ⊢ (𝐴 / ◡ E ) = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 2724 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
2 | 1 | ecid 6555 | . . . . . 6 ⊢ [𝑥]◡ E = 𝑥 |
3 | 2 | eqeq2i 2175 | . . . . 5 ⊢ (𝑦 = [𝑥]◡ E ↔ 𝑦 = 𝑥) |
4 | equcom 1693 | . . . . 5 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
5 | 3, 4 | bitri 183 | . . . 4 ⊢ (𝑦 = [𝑥]◡ E ↔ 𝑥 = 𝑦) |
6 | 5 | rexbii 2471 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑦 = [𝑥]◡ E ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦) |
7 | vex 2724 | . . . 4 ⊢ 𝑦 ∈ V | |
8 | 7 | elqs 6543 | . . 3 ⊢ (𝑦 ∈ (𝐴 / ◡ E ) ↔ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]◡ E ) |
9 | risset 2492 | . . 3 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦) | |
10 | 6, 8, 9 | 3bitr4i 211 | . 2 ⊢ (𝑦 ∈ (𝐴 / ◡ E ) ↔ 𝑦 ∈ 𝐴) |
11 | 10 | eqriv 2161 | 1 ⊢ (𝐴 / ◡ E ) = 𝐴 |
Colors of variables: wff set class |
Syntax hints: = wceq 1342 ∈ wcel 2135 ∃wrex 2443 E cep 4259 ◡ccnv 4597 [cec 6490 / cqs 6491 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rex 2448 df-v 2723 df-sbc 2947 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-br 3977 df-opab 4038 df-eprel 4261 df-xp 4604 df-cnv 4606 df-dm 4608 df-rn 4609 df-res 4610 df-ima 4611 df-ec 6494 df-qs 6498 |
This theorem is referenced by: dfcnqs 7773 |
Copyright terms: Public domain | W3C validator |