| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ecexr | Structured version Visualization version GIF version | ||
| Description: A nonempty equivalence class implies the representative is a set. (Contributed by Mario Carneiro, 9-Jul-2014.) |
| Ref | Expression |
|---|---|
| ecexr | ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0i 4306 | . . 3 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → ¬ (𝑅 “ {𝐵}) = ∅) | |
| 2 | snprc 4684 | . . . . 5 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅) | |
| 3 | imaeq2 6030 | . . . . 5 ⊢ ({𝐵} = ∅ → (𝑅 “ {𝐵}) = (𝑅 “ ∅)) | |
| 4 | 2, 3 | sylbi 217 | . . . 4 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = (𝑅 “ ∅)) |
| 5 | ima0 6051 | . . . 4 ⊢ (𝑅 “ ∅) = ∅ | |
| 6 | 4, 5 | eqtrdi 2781 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = ∅) |
| 7 | 1, 6 | nsyl2 141 | . 2 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → 𝐵 ∈ V) |
| 8 | df-ec 8676 | . 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵}) | |
| 9 | 7, 8 | eleq2s 2847 | 1 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3450 ∅c0 4299 {csn 4592 “ cima 5644 [cec 8672 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-br 5111 df-opab 5173 df-xp 5647 df-cnv 5649 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ec 8676 |
| This theorem is referenced by: relelec 8721 ecdmn0 8726 erdisj 8731 eqvreldisj 38612 |
| Copyright terms: Public domain | W3C validator |