| 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 2848 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 2 | eleq2 2849 | . 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 2145 |
| 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 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2752 df-clel 2835 |
| This theorem is used by: rru 3737 trel 5220 epelg 5556 preleqg 9594 preleqALT 9596 oemapval 9662 cantnf 9672 wemapwe 9676 nnsdomel 9995 matunitlindf 22903 cldval 23248 isufil 24129 taylthlem2 26610 umgr2v2enb1 29986 issiga 34622 bj-epelg 37812 rdgssun 38132 wepwsolem 43883 aomclem8 43902 grumnud 45110 nelbr 48162 |
| Copyright terms: Public domain | W3C validator |