| 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 4294 | . . 3 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → ¬ (𝑅 “ {𝐵}) = ∅) | |
| 2 | snprc 4684 | . . . . 5 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅) | |
| 3 | imaeq2 6060 | . . . . 5 ⊢ ({𝐵} = ∅ → (𝑅 “ {𝐵}) = (𝑅 “ ∅)) | |
| 4 | 2, 3 | sylbi 220 | . . . 4 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = (𝑅 “ ∅)) |
| 5 | ima0 6081 | . . . 4 ⊢ (𝑅 “ ∅) = ∅ | |
| 6 | 4, 5 | eqtrdi 2814 | . . 3 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = ∅) |
| 7 | 1, 6 | nsyl2 142 | . 2 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → 𝐵 ∈ V) |
| 8 | df-ec 8697 | . 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵}) | |
| 9 | 7, 8 | eleq2s 2881 | 1 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∅c0 4287 {csn 4590 “ cima 5666 [cec 8693 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-xp 5669 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ec 8697 |
| This theorem is referenced by: relelec 8743 ecdmn0 8748 erdisj 8753 eqvreldisj 39325 |
| Copyright terms: Public domain | W3C validator |