![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > qsinxp | GIF version |
Description: Restrict the equivalence relation in a quotient set to the base set. (Contributed by Mario Carneiro, 23-Feb-2015.) |
Ref | Expression |
---|---|
qsinxp | ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (𝐴 / 𝑅) = (𝐴 / (𝑅 ∩ (𝐴 × 𝐴)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ecinxp 6636 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → [𝑥]𝑅 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))) | |
2 | 1 | eqeq2d 2201 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = [𝑥]𝑅 ↔ 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴)))) |
3 | 2 | rexbidva 2487 | . . 3 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅 ↔ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴)))) |
4 | 3 | abbidv 2307 | . 2 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))}) |
5 | df-qs 6565 | . 2 ⊢ (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} | |
6 | df-qs 6565 | . 2 ⊢ (𝐴 / (𝑅 ∩ (𝐴 × 𝐴))) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥](𝑅 ∩ (𝐴 × 𝐴))} | |
7 | 4, 5, 6 | 3eqtr4g 2247 | 1 ⊢ ((𝑅 “ 𝐴) ⊆ 𝐴 → (𝐴 / 𝑅) = (𝐴 / (𝑅 ∩ (𝐴 × 𝐴)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2160 {cab 2175 ∃wrex 2469 ∩ cin 3143 ⊆ wss 3144 × cxp 4642 “ cima 4647 [cec 6557 / cqs 6558 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4192 ax-pr 4227 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-rex 2474 df-v 2754 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-br 4019 df-opab 4080 df-xp 4650 df-rel 4651 df-cnv 4652 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-ec 6561 df-qs 6565 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |