| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sneqrg | Structured version Visualization version GIF version | ||
| Description: Closed form of sneqr 4803. (Contributed by Scott Fenton, 1-Apr-2011.) (Proof shortened by JJ, 23-Jul-2021.) |
| Ref | Expression |
|---|---|
| sneqrg | ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snidg 4624 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
| 2 | eleq2 2851 | . . 3 ⊢ ({𝐴} = {𝐵} → (𝐴 ∈ {𝐴} ↔ 𝐴 ∈ {𝐵})) | |
| 3 | 1, 2 | syl5ibcom 248 | . 2 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 ∈ {𝐵})) |
| 4 | elsng 4601 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) | |
| 5 | 3, 4 | sylibd 242 | 1 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐵} → 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 {csn 4587 |
| 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 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-sn 4588 |
| This theorem is used by: sneqr 4803 sneqbg 4806 snsssng 32973 preimane 33127 altopth1 36530 altopth2 36531 diag1f1lem 50217 diag2f1lem 50219 |
| Copyright terms: Public domain | W3C validator |