| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rabsnt | Structured version Visualization version GIF version | ||
| Description: Truth implied by equality of a restricted class abstraction and a singleton. (Contributed by NM, 29-May-2006.) (Proof shortened by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| rabsnt.1 | ⊢ 𝐵 ∈ V |
| rabsnt.2 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| rabsnt | ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝐵} → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabsnt.1 | . . . 4 ⊢ 𝐵 ∈ V | |
| 2 | 1 | snid 4630 | . . 3 ⊢ 𝐵 ∈ {𝐵} |
| 3 | id 23 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝐵} → {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝐵}) | |
| 4 | 2, 3 | eleqtrrid 2872 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝐵} → 𝐵 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) |
| 5 | rabsnt.2 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) | |
| 6 | 5 | elrab 3652 | . . 3 ⊢ (𝐵 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ (𝐵 ∈ 𝐴 ∧ 𝜓)) |
| 7 | 6 | simprbi 503 | . 2 ⊢ (𝐵 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} → 𝜓) |
| 8 | 4, 7 | syl 18 | 1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} = {𝐵} → 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 {crab 3418 Vcvv 3457 {csn 4591 |
| 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 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-sn 4592 |
| This theorem is used by: ddemeas 34650 |
| Copyright terms: Public domain | W3C validator |