| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqeq1dALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of eqeq1d 2771, shorter but requiring ax-12 2219. (Contributed by NM, 27-Dec-1993.) (Revised by Wolf Lammen, 19-Nov-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| eqeq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| eqeq1dALT | ⊢ (𝜑 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1d.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | dfcleq 2762 | . . . . . 6 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | |
| 3 | 1, 2 | sylib 221 | . . . . 5 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 4 | 3 | 19.21bi 2231 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| 5 | 4 | bibi1d 346 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐶))) |
| 6 | 5 | albidv 1947 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶) ↔ ∀𝑥(𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐶))) |
| 7 | dfcleq 2762 | . 2 ⊢ (𝐴 = 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶)) | |
| 8 | dfcleq 2762 | . 2 ⊢ (𝐵 = 𝐶 ↔ ∀𝑥(𝑥 ∈ 𝐵 ↔ 𝑥 ∈ 𝐶)) | |
| 9 | 6, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝜑 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1565 = wceq 1567 ∈ 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-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 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |