| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elqsecl | Structured version Visualization version GIF version | ||
| Description: Membership in a quotient set by an equivalence class according to ∼. (Contributed by Alexander van der Vekens, 12-Apr-2018.) (Revised by AV, 30-Apr-2021.) |
| Ref | Expression |
|---|---|
| elqsecl | ⊢ (𝐵 ∈ 𝑋 → (𝐵 ∈ (𝑊 / ∼ ) ↔ ∃𝑥 ∈ 𝑊 𝐵 = {𝑦 ∣ 𝑥 ∼ 𝑦})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elqsg 8770 | . 2 ⊢ (𝐵 ∈ 𝑋 → (𝐵 ∈ (𝑊 / ∼ ) ↔ ∃𝑥 ∈ 𝑊 𝐵 = [𝑥] ∼ )) | |
| 2 | vex 3462 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 3 | dfec2 8706 | . . . . 5 ⊢ (𝑥 ∈ V → [𝑥] ∼ = {𝑦 ∣ 𝑥 ∼ 𝑦}) | |
| 4 | 2, 3 | mp1i 14 | . . . 4 ⊢ (𝐵 ∈ 𝑋 → [𝑥] ∼ = {𝑦 ∣ 𝑥 ∼ 𝑦}) |
| 5 | 4 | eqeq2d 2777 | . . 3 ⊢ (𝐵 ∈ 𝑋 → (𝐵 = [𝑥] ∼ ↔ 𝐵 = {𝑦 ∣ 𝑥 ∼ 𝑦})) |
| 6 | 5 | rexbidv 3192 | . 2 ⊢ (𝐵 ∈ 𝑋 → (∃𝑥 ∈ 𝑊 𝐵 = [𝑥] ∼ ↔ ∃𝑥 ∈ 𝑊 𝐵 = {𝑦 ∣ 𝑥 ∼ 𝑦})) |
| 7 | 1, 6 | bitrd 282 | 1 ⊢ (𝐵 ∈ 𝑋 → (𝐵 ∈ (𝑊 / ∼ ) ↔ ∃𝑥 ∈ 𝑊 𝐵 = {𝑦 ∣ 𝑥 ∼ 𝑦})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 {cab 2744 ∃wrex 3092 Vcvv 3458 class class class wbr 5114 [cec 8701 / cqs 8702 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 df-cnv 5674 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-ec 8705 df-qs 8709 |
| This theorem is used by: eclclwwlkn1 30463 |
| Copyright terms: Public domain | W3C validator |