![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ecelqsg | GIF version |
Description: Membership of an equivalence class in a quotient set. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 9-Jul-2014.) |
Ref | Expression |
---|---|
ecelqsg | ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2177 | . . 3 ⊢ [𝐵]𝑅 = [𝐵]𝑅 | |
2 | eceq1 6572 | . . . . 5 ⊢ (𝑥 = 𝐵 → [𝑥]𝑅 = [𝐵]𝑅) | |
3 | 2 | eqeq2d 2189 | . . . 4 ⊢ (𝑥 = 𝐵 → ([𝐵]𝑅 = [𝑥]𝑅 ↔ [𝐵]𝑅 = [𝐵]𝑅)) |
4 | 3 | rspcev 2843 | . . 3 ⊢ ((𝐵 ∈ 𝐴 ∧ [𝐵]𝑅 = [𝐵]𝑅) → ∃𝑥 ∈ 𝐴 [𝐵]𝑅 = [𝑥]𝑅) |
5 | 1, 4 | mpan2 425 | . 2 ⊢ (𝐵 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 [𝐵]𝑅 = [𝑥]𝑅) |
6 | ecexg 6541 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → [𝐵]𝑅 ∈ V) | |
7 | elqsg 6587 | . . . 4 ⊢ ([𝐵]𝑅 ∈ V → ([𝐵]𝑅 ∈ (𝐴 / 𝑅) ↔ ∃𝑥 ∈ 𝐴 [𝐵]𝑅 = [𝑥]𝑅)) | |
8 | 6, 7 | syl 14 | . . 3 ⊢ (𝑅 ∈ 𝑉 → ([𝐵]𝑅 ∈ (𝐴 / 𝑅) ↔ ∃𝑥 ∈ 𝐴 [𝐵]𝑅 = [𝑥]𝑅)) |
9 | 8 | biimpar 297 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 [𝐵]𝑅 = [𝑥]𝑅) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
10 | 5, 9 | sylan2 286 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ∃wrex 2456 Vcvv 2739 [cec 6535 / cqs 6536 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2741 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-xp 4634 df-cnv 4636 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-ec 6539 df-qs 6543 |
This theorem is referenced by: ecelqsi 6591 qliftlem 6615 eroprf 6630 |
Copyright terms: Public domain | W3C validator |