| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eleq2dALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of eleq2d 2855, shorter at the expense of requiring ax-12 2219. (Contributed by NM, 27-Dec-1993.) (Revised by Wolf Lammen, 20-Nov-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| eleq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| eleq2dALT | ⊢ (𝜑 → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1d.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | dfcleq 2762 | . . . . . 6 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 3 | 1, 2 | sylib 221 | . . . . 5 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 4 | 3 | 19.21bi 2231 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 5 | 4 | anbi2d 641 | . . 3 ⊢ (𝜑 → ((𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵))) |
| 6 | 5 | exbidv 1948 | . 2 ⊢ (𝜑 → (∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴) ↔ ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵))) |
| 7 | dfclel 2845 | . 2 ⊢ (𝐶 ∈ 𝐴 ↔ ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴)) | |
| 8 | dfclel 2845 | . 2 ⊢ (𝐶 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵)) | |
| 9 | 6, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝜑 → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1565 = wceq 1567 ∃wex 1806 ∈ wcel 2149 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-12 2219 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-cleq 2761 df-clel 2844 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |