| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbceqal | Structured version Visualization version GIF version | ||
| Description: Class version of one implication of equvelv 2061. (Contributed by Andrew Salmon, 28-Jun-2011.) (Proof shortened by SN, 26-Oct-2024.) |
| Ref | Expression |
|---|---|
| sbceqal | ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2767 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐴 ↔ 𝐴 = 𝐴)) | |
| 2 | eqeq1 2767 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵)) | |
| 3 | 1, 2 | imbi12d 347 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵))) |
| 4 | eqid 2763 | . . . 4 ⊢ 𝐴 = 𝐴 | |
| 5 | 4 | a1bi 365 | . . 3 ⊢ (𝐴 = 𝐵 ↔ (𝐴 = 𝐴 → 𝐴 = 𝐵)) |
| 6 | 3, 5 | bitr4di 292 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 → 𝑥 = 𝐵) ↔ 𝐴 = 𝐵)) |
| 7 | 6 | spcgv 3555 | 1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1568 = wceq 1570 ∈ wcel 2143 |
| This proof depends on 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 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 |
| This theorem is used by: sbeqalb 3806 |
| Copyright terms: Public domain | W3C validator |