| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eleq12 | Structured version Visualization version GIF version | ||
| Description: Equality implies equivalence of membership. (Contributed by NM, 31-May-1999.) |
| Ref | Expression |
|---|---|
| eleq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2852 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 2 | eleq2 2853 | . 2 ⊢ (𝐶 = 𝐷 → (𝐵 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) | |
| 3 | 1, 2 | sylan9bb 519 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2755 df-clel 2839 |
| This theorem is used by: rur 3740 trel 5226 epelg 5559 preleqg 9653 preleqALT 9655 oemapval 9721 cantnf 9731 wemapwe 9735 nnsdomel 10110 matunitlindf 23051 cldval 23396 isufil 24277 taylthlem2 26758 umgr2v2enb1 30164 issiga 34855 bj-epelg 38253 rdgssun 38569 wepwsolem 44315 aomclem8 44329 grumnud 45531 nelbr 48617 |
| Copyright terms: Public domain | W3C validator |