| 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 2849 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) | |
| 2 | eleq2 2850 | . 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 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-cleq 2753 df-clel 2836 |
| This theorem is used by: rru 3737 trel 5220 epelg 5552 preleqg 9609 preleqALT 9611 oemapval 9677 cantnf 9687 wemapwe 9691 nnsdomel 10064 matunitlindf 22989 cldval 23334 isufil 24215 taylthlem2 26694 umgr2v2enb1 30100 issiga 34737 bj-epelg 37963 rdgssun 38281 wepwsolem 44028 aomclem8 44047 grumnud 45255 nelbr 48313 |
| Copyright terms: Public domain | W3C validator |